# Data Structure MCQ - Tree

Q1.The number of edges from the root to the node is called __________ of the tree.

- Height
- Depth
- Length
- Width

Answer:- (B)

**Explanations :**The number of edges from the root to the node is called depth of the tree.- Height
- Depth
- Length
- Width

Answer:- (A).

**Explanations :**The number of edges from the node to the deepest leaf is called height of the tree.- L = 2*I
- L = I + 1
- L = I – 1
- L = 2*I – 1

Answer:- (B).

**Explanations :**Number of Leaf nodes in full binary tree is equal to 1 + Number of Internal Nodes i.e L = I + 1
Answer:- (D).

Postorder Traversal: N, P, Q, O, M

Inorder Traversal: N, M, P, O, Q

Root node of tree is the last visiting node in Postorder traversal. Thus, Root Node = ‘M’.

**Explanations :**Here,Postorder Traversal: N, P, Q, O, M

Inorder Traversal: N, M, P, O, Q

Root node of tree is the last visiting node in Postorder traversal. Thus, Root Node = ‘M’.

- 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

Answer:- (C).

- In-order predecessor
- In-order successor
- Pre-order predecessor
- None

Answer:- (B).

- Pre-order successor
- In-order successor
- Post-order successor
- In-order predecessor

Answer:- (B).

- 2, 252, 401, 398, 330, 344, 397, 363
- 924, 220, 911, 244, 898, 258, 362, 363
- 925, 202, 911, 240, 912, 245, 258, 363
- 2, 399, 387, 219, 266, 382, 381, 278, 363

Answer:- (C).

- Synonyms trees
- Joint trees
- Equivalent trees
- Similar trees

Answer:- (D).

**Explanations :**- cache Implementation
- networks
- send values
- receive values

Answer:- (A).

**Explanations :**Splay trees can be used for faster access to recently accessed items and hence used for cache implementationCopyright © 2022 Shineskill Software Pvt. Ltd., All rights reserved.