# Trees Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Trees ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate knowledge on Trees comprehensively.

## 1. In ………….. the difference between the height of the left sub tree and height of right sub tree, for each node, is not more than one.

BST

Complete Binary Tree

AVL-tree

Balanced Search tree

31

16

32

15

Unary tree

Binary tree

Trinary tree

Both B and C

T–1

2t–1

2t

T

## 5. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ……

AVL tree

Red-black tree

Lemma tree

None of the above

## 6. A binary search tree, also known as_________.

Binary tree

Binary sorted tree

Sibling node

Heap trees

In-order

Pre-order

Post-order

Any order

## 8. A binary tree can easily be converted into a 2-tree

By replacing each empty sub tree by a new internal node

By inserting an internal nodes for non-empty node

By inserting an external nodes for non-empty node

By replacing each empty sub tree by a new external node

## 9. A binary tree having n nodes and depth d will be about complete binary tree if

It contains log(d)+1 nodes

Any node nd at level less than d-1 has two sons

For any node nd in the tree with a right descendent at level d lt must have a left son

All of these

## 10. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

Has exactly 17 nodes

Has exactly 19 nodes

Cannot have more than 19 nodes

None of these

## 11. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

Full binary tree

Binary Search Tree

Complete binary tree

## 12. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as

Full binary tree

AVL tree

Complete binary tree

Left sub tree

Right sub tree

Both (a) and (b)

Heap tree

Dual level

Multilevel

Tri level

Single level

(3,6)

(4,7)

(6,3)

(7,4)

0Shares
Scroll to Top