Home
Recent Q&A
Java
Cloud
JavaScript
Python
SQL
PHP
HTML
C++
Data Science
DBMS
Devops
Hadoop
Machine Learning
Azure
Blockchain
Devops
Ask a Question
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
Home
Data Structures & Algorithms
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is...
+1
vote
asked
Dec 6, 2022
in
Data Structures & Algorithms
by
sharadyadav1986
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
binary-search
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Dec 6, 2022
by
sharadyadav1986
a) avl tree
...