Binary Trees and Graphs Quiz

What is a complete binary tree?

• A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

• A tree In which all nodes have degree 2

• Each node has exactly zero or two children

• A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

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 either a leaf node or a node with empty left child

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

• Inorder successor may be an ancestor of the node

• Inorder Successor is always a leaf node

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

• 2

• 4

• 6

• 3

Which of the following is false about a binary search tree?

• The right child is always greater than its parent

• In order sequence gives decreasing order of elements

• The left and right sub-trees should also be binary search trees

• The left child is always lesser than its parent

What is the time complexity of level order traversal?

• O(1)

• O(n)

• O(nlogn)

• O(logn)

The Binary Tree in which all leaves are on the same level is called as

• Complete Binary Tree

• Strictly Binary Tree

• Full Binary Tree

• Skewed Tree

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

• 67

• 83

• 69

• 65

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

• True

• False

If binary trees are represented in arrays, what formula can be used to locate a left child, if the node has an index i?

• (i+1)/2

• 2i

• 2i+1

• 2i+2

Using what formula can a parent node be located in an array?

• (i-1)/2

• (i+1)/2

• i/2

• 2i/2