Question # 14
A binary search tree in which for every node in the tree, the height of the left right subtrees can differ by at most 1 is
a
B-tree
b
AVL tree
c
Expression tree
d
Splay tree
e
None of the others