K-ary Tree Multiple Choice Questions and Answers (MCQs) – 1

«
»

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

1. How many child nodes does each node of K-ary Tree contain?
a) 2
b) 3
c) more than k
d) at most k
View Answer

Answer: d
Explanation: Each node of K-ary tree contains at most k nodes. While tree with 2 nodes is called Binary tree and tree with 3 nodes is called Ternary tree.
advertisement

2. Which of the following is the name of the node having child nodes?
a) Brother
b) Sister
c) Mother
d) Parent
View Answer

Answer: d
Explanation: Parent node is the node having child nodes and child nodes may contain references to their parents. Parent node is a node connected by a directed edge to its child.

3. What is the depth of the root node of K-ary tree?
a) 2
b) 1
c) 0
d) 3
View Answer

Answer: c
Explanation: Depth is defined as the length of the path from root to the node. So the depth of root node in K-ary tree is 0.
Note: Join free Sanfoundry classes at Telegram or Youtube
advertisement
advertisement

4. What is the Height of the root node of K-ary tree?
a) 1
b) 2
c) 3
d) 0
View Answer

Answer: d
Explanation: Height of K-ary tree is defined as the length of path from root to deepest node in tree. Therefore, height of root node in K-ary tree is 0.

5. Which node is the root node of the following K-ary tree?
Node A is the root node of the following K-ary tree
a) A
b) B
c) C
d) D
View Answer

Answer: a
Explanation: Node A is called the root node of the above K-ary tree while the Node B, Node C, Node D are called Leaf node.
Take Data Structure I Practice Tests - Chapterwise!
Start the Test Now: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
advertisement

6. Which node is the Leaf node in the following K-ary tree?
Node F is the Leaf node in the following K-ary tree
a) A
b) B
c) D
d) F
View Answer

Answer: d
Explanation: Leaf node is any node that does not contain any children. Since Node F is the node without any children, So F is called Leaf Node. While Node A is root node and Node B, Node C, Node D is parent node of their children.

7. Which node is the parent node of Node 5?
Node 2 is the parent node of Node 5 in the given K-ary tree
a) 1
b) 5
c) 2
d) 3
View Answer

Answer: c
Explanation: Since Node 2 has two children Node 5 and Node 6, So Node 2 is the parent node of Node 5. While Node 1 is root node and Node 3 and Node 5 are Leaf node.
advertisement

8. Is parent node of Node 4 and root node of the given K-ary tree same?
Node 2 is the parent node of Node 5 in the given K-ary tree
a) True
b) False
View Answer

Answer: a
Explanation: Since Root node of the ternary tree is Node 1 and also Node 1 has three children that is Node 2, Node 3, Node 4. So parent node of Node 4 and the root node of the ternary tree are same.

9. Which node is the child node of Node C in the following K-ary tree?
Node F is the Leaf node in the following K-ary tree
a) A
b) C
c) G
d) H
View Answer

Answer: c
Explanation: The Child node is the node that has a directed path from its parent node. Since Node C has a direct path to Node G, So Node G is the Child node.
advertisement

10. Which node is the child node of the Node B in the following K-ary tree?
Node A is the root node of the following K-ary tree
a) A
b) C
c) B
d) No child node
View Answer

Answer: d
Explanation: Since Node B is the Leaf node of the above ternary tree and leaf node has no child node. So there is no child node for Node B in the above K-ary tree.

11. What is the depth of Node F in the given K-ary tree?
Node F is the Leaf node in the following K-ary tree
a) 0
b) 1
c) 2
d) 3
View Answer

Answer: c
Explanation: Depth of the node is the length of the path from root to the node. Here, length of path from root to Node F is 2. So depth of Node F is 2.

12. What is the Height of the given K-ary tree?
The Height of the given K-ary tree is 2 in the following K-ary tree
a) 0
b) 1
c) 2
d) 3
View Answer

Answer: c
Explanation: Height of the tree is defined as the length of the path from root node to the deepest node of the tree. Here deepest nodes are 5,6,7 which are at length 2. So the height of the K-ary tree is 2.

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.

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & technical discussions at Telegram SanfoundryClasses.