A binary search tree where the subtrees of every node differ in height by at…
DSSSB TGT/PGT · 2018 · PGT Computer Science (Female) · 26 Jul 2018 · Shift 1 · Section II: subject
A binary search tree where the subtrees of every node differ in height by at most 1 is called:
- A.
Binary tree
- B.
Binary search tree
- C.
AVL tree
- D.
B+ tree
Attempted by 35 students.
Sign up free to check your answer
Sign up freeLoading lesson…