(d) 88 Retrieval of element is fast in AVL tree. The number of steps required to find an item depends on the distance between the item and the root node. An AVL tree is balanced binary search tree in which the difference between the height of any node’s left and right subtree is at most one. That’s why searching is faster in AVL tree.

7.
How is an insertion of a node into an AVL tree carried out?
(a) By treating an AVL tree as a binary search tree
(b) By updating the balance factors working upward from insertion point to the root
(c) Both a & b
(d) None of the AboveAnswer

(c) Insertion of a node into an AVL tree is similar to binary search tree. For inserting new node, first we have to search the position and then insert the node at its proper position. After insertion, the balance might be change. We already know that balance factor in AVL tree are -1, 0, 1. So the balance factor of any node become other than these value, then we have to restore the property of AVL tree to achieve permissible balance factor.

8.
What would happen if the balance factor of a node in an AVL tree is ‘ 1 ‘
(a) Heights of left and right sub trees become equal
(b) Height of left sub tree is one more than the height of right sub tree
(c) Height of left sub tree is one less than the height of right tree
(d) None of the AboveAnswer

(b) If the balance factor of a node in an AVL tree is ‘ 1 ‘ then Height of left subtree is one more than the height of right subtree.

(c) If there are n nodes then the number of possible binary trees is (1/n+1)*(2nCn)

10.
Which of the following techniques represents the precise sequence of an In – Order Traversal of a Binary Tree?
(a) Visit the Root, Traverse Left Subtree, Traverse Right Subtree
(b) Traverse Left Subtree; Visit the Root, Traverse Right Subtree
(c) Traverse Left Subtree, Traverse Right Subtree, Visit the Root
(d) None of the AboveAnswer

(b)Traversing a binary tree means visiting each node of a tree exactly once. Traversal of tree gives the linear order of nodes. There are three types of traversal in binary tree. Preorder, Inorder and Postorder traversal.