1 votes
3
The post-order traversal of binary tree is $\text{ACEDBHIGF}$. The pre-order traversal is$\text{A B C D E F G H I}$$\text{F B A D C E G I H}$$\text{F A B C D E G H I}$$\t...
0 votes
4
The minimum height of an AVL tree with $n$ nodes is$\text{Ceil } (\log_2(n+1))$$1.44\ \log_2n$$\text{Floor } (\log_2(n+1))$$1.64\ \log_2n$
0 votes
7