What is an AVL tree? – McqOptions

MCQOPTIONS

1.	What is an AVL tree?
A.	a tree which is balanced and is a height balanced tree
B.	a tree which is unbalanced and is a height balanced tree
C.	a tree with three children
D.	a tree with atmost 3 children
Answer» B. a tree which is unbalanced and is a height balanced tree

Discussion

No Comment Found

Related MCQs

Why to prefer red-black trees over AVL trees?
Consider the below left-left rotation pseudo code where the node contains value pointers to left, right child nodes and a height value and Height() function returns height value stored at a particular node. What is missing?
Consider the pseudo code: Does the above code can check if a binary search tree is an AVL tree?
Which of the below diagram is following AVL tree property? i.ii.
What maximum difference in heights between the leafs of a AVL tree is possible?
Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?
What is the maximum height of an AVL tree with p nodes?
Why we need to a binary tree which is height balanced?
What is an AVL tree?