Interview Questions

1. The node that has no children is referred as:

Options:

a. Parent node

b. Root node

c. Leaf node

d. Siblings

Reveal Answer

2. A binary tree in which all the leaves are on the same level is called as:

Options:

a. Complete binary tree

b. Full binary tree

c. Strictly binary tree

d. Binary Search Tree

Reveal Answer

3. How can the graphs be represented?

Options:

a. Adjacent matrix

b. Adjacency list

c. Incidence matrix

d. All of above

Reveal Answer

4. The children of same parent node are called as:

Options:

a. Adjacent node

b. Non-leaf node

c. Siblings

d. Leaf node

Reveal Answer

5. The maximum number of nodes at any level is:

Options:

a. N

b. 2n

c. N+1

d. 2n

Reveal Answer

6. A tree with n vertices, consist of ----------------- edges.

Options:

a. N-1

b. N-2

c. N

d. Log n

Reveal Answer

7. Select the one true statement

Options:

a. Every binary tree is either complete or full

b. Every complete binary tree is also a full binary tree

c. Every full binary tree is also a complete binary tree

d. No binary tree is both complete and full

Reveal Answer

8. Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?

Options:

a. 0

b. 3

c. 4

d. 5

Reveal Answer

9. Select the one FALSE statement about binary trees:

Options:

a. Every binary tree has at least one node

b. Every non-empty tree has exactly one root node

c. Every node has at most two children

d. Every non-root node has exactly one parent

Reveal Answer

10. 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:

a. Data[i+1]

b. Data[i+2]

c. Data[2*i+1]

d. Data[2*i+2]

Reveal Answer

11. The data structure used by level order traversal of binary tree is:

Options:

a. Queue

b. Stack

c. Linked List

d. None of above

Reveal Answer

12. The depth of a complete binary tree with n nodes is:

Options:

a. Logn

b. N2

c. Log2 n + 1

d. 2n

Reveal Answer

Interview Questions and Answer

1. The node that has no children is referred as:

2. A binary tree in which all the leaves are on the same level is called as:

3. How can the graphs be represented?

4. The children of same parent node are called as:

5. The maximum number of nodes at any level is:

6. A tree with n vertices, consist of ----------------- edges.

7. Select the one true statement

8. Suppose T is a binary tree with 14 nodes. What is the minimum possible depth of T?

9. Select the one FALSE statement about binary trees:

10. 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?

11. The data structure used by level order traversal of binary tree is:

12. The depth of a complete binary tree with n nodes is:

Packages

Resources

About

Other links