Question $3$:

Discuss the differences between the binary search tree $($BST$)$ property and the max$-$heap property. Additionally, evaluate whether the max$-$heap property can be effectively used to retrieve and print the keys of an n$-$node tree in sorted order in $\backslash ($ O$($n$)\backslash )$ time. Support your answer with explanations or examples.