ADSQUIZ

What is the maximum height of an AVL tree with p nodes?

• a) p

• b) log(p)

• c) log(p)/2

• d) p/2

Why we need to a binary tree which is height balanced?

• a) to avoid formation of skew trees

• b) to save memory

• c) to attain faster memory access

• d) to simplify storing

What is the balance factor of node 8?

• 2

• -1

• +1

• -2

For the tree below, write the in-order traversal.

• a) 6, 2, 5, 7, 11, 2, 5, 9, 4

• b) 6, 5, 2, 11, 7, 4, 9, 5, 2

• c) 2, 7, 2, 6, 5, 11, 5, 9, 4

• d) 2, 7, 6, 5, 11, 2, 9, 5, 4

Select the code snippet which performs in-order traversal.

• public void inorder(Tree root) { System.out.println(root.data); inorder(root.left); inorder(root.right); }

• public void inorder(Tree root) { inorder(root.left); System.out.println(root.data); inorder(root.right); }

• public void inorder(Tree root) { System.out.println(root.data); inorder(root.right); inorder(root.left); }

• public void inorder(Tree root) { inorder(root.right); inorder(root.left); System.out.println(root.data); }

In a binary search tree, which of the following traversals would print the numbers in the ascending order?

• Level order

• Preorder

• Inorder

• Level order

• Spiral order

In postorder traversal of binary tree right subtree is traversed before visiting root.

• True

• False

• Can't say

The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be ________

• a) T Q R S O P

• b) T O Q R P S

• c) T Q O P S R

• d) T Q O S P R

A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

• a) 7, 8, 26, 13, 75, 40, 70, 35

• b) 26, 13, 7, 8, 70, 75, 40, 35

• c) 7, 8, 13, 26, 35, 40, 70, 75

• d) 8, 7, 26, 13, 40, 75, 70, 35

Find the postorder traversal of the binary tree shown below.

• a) P Q R S T U V W X

• b) W R S Q P V T U X

• c) S W T Q X U V R P

• d) S T W U X V Q R P