In ............., the difference between the height of the left sub tree and height of the right tree, for each node, is almost one.
A. Binary search tree
B. AVL - tree
C. Complete tree
D. Threaded binary tree
Answer:B
In ............., the difference between the height of the left sub tree and height of the right tree, for each node, is almost one.
A. Binary search tree B. AVL - tree C. Complete tree D. Threaded binary tree