(1) what is the height of node "C" ? (2) what is the height of node "D" ? (3) what is the height of node "F" ?
(1) what is the height of node "C" ?
(2) what is the height of node "D" ?
(3) what is the height of node "F" ?
(4) what is the left-subtree-height of "C"
(5) what is the right-subtree-height of "C"
(6) what is the balance factor of "C' ?
(7) what is the left-subtree-height of "D"
(8) what is the right-subtree-height of "D"
(9) what is the balance factor of "D" ?
(10) what is the left-subtree-height of "F"
(11) what is the right-subtree-height of "F"
(12) what is the balance factor of "F" ?
(13) Please write down the unbalance nodes if any. If every node is balanced, just enter "none". If more than one node is unbalanced, separate them by one comma. Ex: Y,X
(14) There are four imbalance cases: LL, LR, RL, and RR. Please indicate the imbalance case of the previous unbalanced node . If every node balanced, just enter "none". If more than one node is unbalanced, just indicate the case for the first unbalanced node.
(15) If an AVL tree has N elements, what could be the Big O notation of the search function of this AVL tree in terms of N ?
As per our company guidelines, only 3 sub parts will be answered. So, please repost the remaining questions separately.
Tree is a non linear data structure which is hierarchical and used to represent and organize the data in such a way that it is easy to navigate and search. Tree contains vertices or nodes which are connected by edges. Each node contains specific value.
Step by step
Solved in 3 steps
