Question No:
1 of 12
The node that has no children is referred as:
Options:

Parent node

Root node

Leaf node

Siblings
Question No:
2 of 12
A binary tree in which all the leaves are on the same level is called as:
Options:

Complete binary tree

Full binary tree

Strictly binary tree

Binary Search Tree
Question No:
3 of 12
How can the graphs be represented?
Options:

Adjacent matrix

Adjacency list

Incidence matrix

All of above
Question No:
4 of 12
The children of same parent node are called as:
Options:

Adjacent node

Nonleaf node

Siblings

Leaf node
Question No:
5 of 12
The maximum number of nodes at any level is:
Options:

N

2n

N+1

2n
Question No:
6 of 12
A tree with n vertices, consist of  edges.
Options:

N1

N2

N

Log n
Question No:
7 of 12
Select the one true statement
Options:

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

No binary tree is both complete and full
Question No:
8 of 12
Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?
Options:

0

3

4

5
Question No:
9 of 12
Select the one FALSE statement about binary trees:
Options:

Every binary tree has at least one node

Every nonempty tree has exactly one root node

Every node has at most two children

Every nonroot node has exactly one parent
Question No:
10 of 12
Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child’s value be stored?
Options:

Data[i+1]

Data[i+2]

Data[2*i+1]

Data[2*i+2]