1.

A tree in which, for every node, the difference between the height of its left subtree and right subtree is not more than one is (A) AVL Tree.(B) Complete Binary Tree.(C) B – Tree.(D) + B Tree

Answer»

Correct option- (A) AVL Tree. 



Discussion

No Comment Found

Related InterviewSolutions