How can we define a AVL tree?
2024
How can we define a AVL tree?
Answer: A. A tree which is binary search tree and height balanced tree. — Answer: a Explanation: The answer is a. An AVL tree is a binary search tree and height balanced tree.
- A.
A tree which is binary search tree and height balanced tree.
- B.
A tree which is a binary search tree but unbalanced tree.
- C.
A tree with utmost two children
- D.
A tree with utmost three children
Attempted by 660 students.
Show answer & explanation
Correct answer: A
Answer: a
Explanation: The answer is a. An AVL tree is a binary search tree and height balanced tree.
Loading lesson…