A2 Trees Quiz

Assume the level of root node is 1 and the levels of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is

• 2^i

• 2^(i-1)

• 2^(i+1)

• 2^i + 1

The maximum number of binary trees that can be formed with three nodes

• 3

• 4

• 5

• 2

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 4 are

• 31 and 5

• 32 and 5

• 15 and 5

• 15 and 4

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• W is an internal node

• V is a leaf node

• S is a root node

• B is a leaf node

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• Balance Factor of node S is -2

• Balance Factor of node S is +2

• Balance Factor of node S is -1

• Balance Factor of node S is +1

When the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree, the CORRECT option is

• Balance Factor of all nodes are -1, 0 or +1, so the tree is an AVL tree

• Balance Factor of node S needs to be altered

• Balance Factor of node M needs to be altered

• Node S has to be rotated to Right for Height adjustment

Initially the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree. It has been checked and made to an AVL tree. The CORRECT option is

• Double rotation (Right, Left) makes the tree into an AVL tree

• Single Right rotation makes the tree into an AVL tree

• Single Left rotation makes the tree into an AVL tree

• Double rotation (Left, Right) makes the tree into an AVL tree

Balance factor is defined as the

• Difference between Left sub tree and Right sub tree

• Difference between the height of Left sub tree and the height of Right sub tree

• Difference between Right sub tree and Left sub tree

• Difference between the height of Right sub tree and the height of Left sub tree

Initially the keys like M, S, G, H, B, V, W, T are inserted into Binary Search Tree. It has been checked and made to an AVL tree. The CORRECT option is

• S forms the leaf node

• S forms the root node

• S has two children

• S has only Right child T

Assume there is a tree in which every node has a value greater than value of any node in its LST but lesser than any node in its RST. An inorder traversal of this tree shall result in

• a sorted sequence in ascending order

• a sorted sequence in descending order

• sequence is sorted only of tree is a complete or full binary tree

• sequence is not always sorted