Rotations in deletion have ______ cases for single rotations.
a) 3 b) 4 c) 2 d) 1
In AVL tree delete to delete will require you to go all the way back to the looking for imbalances.
a) Child b) First c) Root d) Parent
In AVL tree delete ________ children is used to replace it with null.
a) Zero b) Two c) One d) Three
What maximum difference in heights between the leafs of a AVL tree is possible?
a) log (n) where n is the number of nodes b) n where n is the number of nodes c) 0 or 1 d) atmost 1
An AVL delete is similar to a regular ______ tree delete.
a) Float b) Decimal c) Binary d) Char
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
(a) LinkList (b) Stack (c) Queue (d) Tree
Which of the following is not possible as a balance factor of any node of an AVL tree?
a) 0 b) +1 C) -1 D) 2
AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations
a) LL, RL and LR, RR b) LL, RR and LR, RL c) LR, RR and LL, RL d) LR, RL and LR, RL
The balance factor for an AVL tree is either
a) 0,1 or –1 b) –2,–1 or 0 c) 0,1 or 2 d) All the above
A binary search tree whose left sub tree and right sub tree differ in hight by at most 1 unit is called ……
A) AVL tree B) Red-black tree C) Lemma tree D) None of the above
Items 7,3,11,9 and 13 are inserted into an AVL tree. What happens when 12 is inserted?
a) no rotation is needed. b) a single rotation between some node and its left child is performed. c) a single rotation between some node and its right child is performed. d) a double rotation with a node,its left child, …
Read more →
In ______________ tree, the heights of two child sub tree of any node differ by at most one
A. Binary tree B. Red black tree C. Splay tree D. AVL tree
AVL trees have a faster _______________
A. Insertion B. Deletion C. Updation D. Retrival
In ______, the difference between the height of the left sub tree and height of the right tree, for each node, is almost one.
A) Binary search tree B) AVL – tree C) Complete tree D) Threaded binary tree
In BST operations-______ must not leave ‘a gap’ in the tree.
a) removal of node b) incement of node c)decrement of node d) none of these