A binary search tree whose left subtree and right subtree differ in height by…
2017
A binary search tree whose left subtree and right subtree differ in height by at most one is called.
Answer: A. AVL tree — Correct answer: AVL tree
- A.
AVL tree
- B.
Red-black tree
- C.
Complete binary tree
- D.
Strictly binary tree
Attempted by 1451 students.
Show answer & explanation
Correct answer: A
Correct answer: AVL tree
Loading lesson…