+1 vote
in Data Structures & Algorithms by
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

a) avl tree

b) red-black tree

c) lemma tree

d) none of the above

1 Answer

0 votes
by

a) avl tree

Related questions

0 votes
asked Dec 8, 2022 in Data Structures & Algorithms by sharadyadav1986
0 votes
asked Jan 7, 2022 in Data Structures & Algorithms by rajeshsharma
...