A binary search tree whose left subtree and right subtree differ in height by…
NVS Computer Science / IT Teacher Recruitment · Computer Science · 2017
A binary search tree whose left subtree and right subtree differ in height by at most one is called.
- A.
AVL tree
- B.
Red-black tree
- C.
Complete binary tree
- D.
Strictly binary tree
Attempted by 1703 students.
Sign up free to check your answer
Sign up freeLoading lesson…