Trees - Data Structures

Which of the following statement about binary tree is CORRECT?

• Every binary tree is either complete or full

• Every complete binary tree is also a full binary tree

• Every full binary tree is also a complete binary tree

• A binary tree cannot be both complete and full

Which type of traversal of binary search tree outputs the value in sorted order?

• Pre-order

• Post-order

• In-Order

• None

A binary search tree is generated by inserting in order the following integers:

50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24

The number of the node in the left sub-tree and right sub-tree of the root, respectively, is

• (4, 7)

• (7, 4)

• (8, 3)

• (3, 8)

In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as non-empty. Which of the following is true about inorder successor needed in delete operation?

• Inorder Successor is always a leaf node

• Inorder successor is always either a leaf node or a node with empty left child

• Inorder successor may be an ancestor of the node

• Inorder successor is always either a leaf node or a node with empty right child

What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

• 2

• 3

• 4

• 5

In the balanced binary tree in the figure given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?

• 1

• 3

• 7

• 8

Which of the following sequences denotes the post order traversal sequence of the tree?

• f e g c d b a

• g c b d a f e

• g c d b f e a

• f e d g c b a