Binary Search Tree voilates the condition of AVL tree when any-03478
Binary Search Tree voilates the condition of AVL tree when any node has balance equal to
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Final Term - Quiz No.18.
Binary Search Tree voilates the condition of AVL tree when any node has balance equal to
2 or -2
1 or -1
0
None of the options.
