Single Choice Easy

QWhat is an AVL tree?

ID: #5632 Tree 387 views

Question Info

#5632Q ID

EasyDifficulty

TreeTopic

Start Quiz on This Topic

Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

A A tree in which each node has at most one child ✔ ✖
B A tree in which each node has exactly two children ✔ ✖
C A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 1 ✔ ✖
D A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 2 ✔ ✖

Correct Answer

Answer: c) A self-balancing binary search tree in which the difference in height between the left and right subtrees of any node is at most 1

Continue Practice

Previous Question Next Question

Challenge a friend or share with your study group.