Tree where for every node the height of its left subtree and right subtree differ almost by one - AVL tree

Q.  In which tree, for every node the height of its left subtree and right subtree differ almost by one?
- Published on 17 Jun 15

a. Binary search tree
b. AVL tree
c. Threaded Binary Tree
d. Complete Binary Tree

ANSWER: AVL tree

Related Content

➨ Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
▲