This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “K-ary Tree – 2”.

1. What is the size of the given K-ary tree?

a) 3

b) 2

c) 6

d) 4

View Answer

Explanation: Size of the K-ary tree is defined as the total number of nodes present in the tree. Since there are total of 6 nodes in the K-ary tree. So the size of the K-ary tree is 6.

2. Who is the ancestor of Node H?

a) D

b) F

c) H

d) A

View Answer

Explanation: Ancestor node is a node that comes in between the path from the node to the root. Since Node D comes between node H and root, so Node D is called the ancestor node.

3. Who is descendant of Node C?

a) A

b) E

c) D

d) G

View Answer

Explanation: Descendant node is a node which has a direct path from ancestor node. Since Node G is connected to C, so Node G is the descendant of Node C.

4. What is the size of Node B in given K-ary tree?

a) 1

b) 2

c) 3

d) 4

View Answer

Explanation: Size of node is defined as the total number of descendants of that node including itself. So, size of Node B is 1.

5. Can leaf node be called child node in a K-ary tree?

a) True

b) false

View Answer

Explanation: Leaf node is a node that has no child. Since Leaf node will always be the node on the last level of k-ary tree, so it can be called child node of given parent node in K-ary tree.

6. Can child node be always called Leaf node in the K-ary tree?

a) True

b) False

View Answer

Explanation: Leaf node is any node that does not contain any children. Child node may or may not contain more nodes. Child node will only be called leaf Node if the node has no child node.

7. What is the upper bound for maximum leaves in K-ary tree with height h?

a) K*h

b) K^h

c) K+h

d) K-h

View Answer

Explanation: In the K-ary tree having height h, the upper bound for having maximum number of leaves is k^h.

8. What is the height of a K-ary tree having only root node?

a) 1

b) 0

c) 2

d) 3

View Answer

Explanation: Height of a K-ary tree does not include the root node. So the height of the K-ary tree is without root node is 0.

9. Which one of the following is the correct formulae to find the parent node at index I?

a) (I-1)/K

b) (I+1)/K

c) (I*1)/K

d) (I-2)/K

View Answer

Explanation: The parent node for the node of index I in a K-ary tree is given by (I-1)/K.

10. Which nodes are the siblings of Node D of given ternary tree?

a) E

b) C

c) F

d) H

View Answer

Explanation: Siblings are the nodes that share same parent. Since both the Node H is parent Node D, So the sibling of Node D is Node H.

11. How many extra nodes are there in Full K-ary tree than complete K-ary tree?

a) 1

b) 2

c) 3

d) Both have same number of nodes

View Answer

Explanation: Every Full K-ary tree is also a complete K-ary tree. Therefore, both have same number of nodes.

12. Is Node A sibling of Node B in the given K-ary tree?

a) True

b) False

View Answer

Explanation: Node D, Node C are the siblings of Node B while Node A is the parent node of Node B.

**Sanfoundry Global Education & Learning Series – Data Structure.**

To practice all areas of Data Structure, __here is complete set of 1000+ Multiple Choice Questions and Answers__.

**Next Steps:**

- Get Free Certificate of Merit in Data Structure I
- Participate in Data Structure I Certification Contest
- Become a Top Ranker in Data Structure I
- Take Data Structure I Tests
- Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
- Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

**Related Posts:**

- Apply for Computer Science Internship
- Apply for Data Structure Internship
- Buy Computer Science Books
- Practice Programming MCQs
- Practice Computer Science MCQs