This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Ternary Tree

**1. Which nodes are the siblings of Node B of given ternary tree?**

A) E

B) C

C) F**D) Both E and F**

Explanation: Nodes with the same parent are referred to as siblings. Since Node E and Node F share the same parent, Node B, they are Node E and Node F’s siblings.

**2. What is the Height of the given ternary tree?**

A) 0

B) 1**C) 2**

D) 3

Explanation: The length of the path from the root node to the deepest node of the tree is referred to as the tree’s height. The deepest nodes are 5,6,7, and they are 2 in length. As a result, the ternary tree’s height is 2.

**3. Which node is the Leaf node in the following ternary tree?**

A) A

B) B

C) D**D) G**

Explanation: Any node that does not have any children is referred to as a leaf node. Since Node G has no children, it is referred to as a Leaf Node. If Node A is the root node, Node B, Node C, and Node D are their children’s parent nodes.

**4. Which node is the parent node of Node 6?**

A) 1

B) 5**C) 2**

D) 3

Explanation: Node 2 is the parent node of Node 6 because it has two children, Node 5 and Node 6. Node 1 is the root node, and Nodes 3 and 5 are the leaf nodes.

**5. Is parent node of Node 3 and root node of the given ternary tree same?**

**A) True**

B) False

Explanation: Node 1 is the ternary tree’s root node, and Node 1 has three children: Node 2, Node 3, and Node 4. As a result, Node 3’s parent node and the ternary tree’s root node are the same.

**6. Which node is the child node of Node D in the following ternary tree?**

A) A

B) C

C) G**D) H**

Explanation: The node with a guided path from its parent is called a child node. Node H is the child node since Node D has a direct path to it.

**7. Which node is the child node of the Node D in the following ternary tree?**

A) A

B) C

C) B**D) No child node**

Explanation: Since Node D is the Leaf node in the ternary tree above, it has no children. As a result, in the ternary tree above, Node D has no children.

**8. What is the depth of Node G in the given ternary tree?**

A) 0

B) 1**C) 2**

D) 3

Explanation: The depth of a node is the length of the path from the root to it. In this case, the distance between the root and Node G is 2. Node G has a depth of two as a consequence.

**9. How many child nodes does each node of Ternary Tree contain?**

A) 4

B) 6

C) 5**D) 3**

Explanation: Each Ternary tree node has a maximum of three nodes. So a Ternary tree may have one, two, or three child nodes, but not more.

**10. Which of the following is the name of the node having child nodes?**

A) Brother

B) Sister

C) Mother**D) Parent**

Explanation: Child nodes may contain references to their parents, and parent nodes may contain references to their children. A parent node is a node that is connected to its child by a directed edge.

**11. What is the depth of the root node of the ternary tree?**

A) 2

B) 1**C) 0**

D) 3

Explanation: The length of the path from the root to the node is known as depth. As a result, the depth of the root node in a ternary tree is zero.

**12. What is the Height of the root node of ternary tree?**

A) 1

B) 2

C) 3**D) 0**

Explanation: The length of the path from the root to the deepest node in a ternary tree is known as its height. As a result, in a ternary tree, the height off the root node is 0.

**13. Which node is the root node of the following ternary tree?**

**A) A**

B) B

C) C

D) D

Explanation: The root node of the above ternary tree is Node A, while the leaf nodes are Node B, Node C, and Node D.

**14. Can leaf node be called child node in a ternary tree?****A) True**

B) False

Explanation: A leaf node is a node that does not have any children. Since the leaf node is always the last node in a ternary tree, it can be referred to as the child node of a given parent node.

**15. Can child node be always called Leaf node in the ternary tree?**

A) True**B) False**

Explanation: Any node that does not have any children is referred to as a leaf node. There may or may not be more nodes in a child node. If the node has no children, the child node is referred to as a leaf node.

**16. Which of the following is the implementation of the ternary tree?**

A) AVL Tree**B) Ternary Heap**

C) Hash Table

D) Dictionary

Explanation: Ternary trees are used to implement ternary heap and ternary search trees. Different forms of Data Structures include the AVL Tree, hash Table, and dictionary.

**17. What is the size of Node A?**

A) 1

B) 2

C) 3**D) 4**

Explanation: The total number of descendants of a node, including itself, is defined as its size. As a result, Node A has a size of four.

**18. Who is descendant of Node B?**

A) A

B) E

C) F**D) Both E and F**

Explanation: A descendant node is one that has a direct connection to the ancestor node. Nodes E and F are descendants of Node B since they are both bound to B.

**19. Who is the ancestor of Node G?**

**A) C**

B) F

C) H

D) A

Explanation: An ancestor node is a node that exists between the node and the root. Since Node C is located between Node G and the root, it is referred to as the ancestor node.

**20. What is the size of the given ternary tree?**

A) 3

B) 2**C) 6**

D) 4

Explanation: The total number of nodes in the ternary tree is known as the tree’s size. Since the ternary tree has a total of six nodes. As a result, the ternary tree has a size of 6.

**21. Is Node A sibling of Node D in the given ternary tree?**

A) True**B) False**

Explanation: Nodes B and C are Node D’s relatives, while Node A is Node D’s parent node.

**22. How many extra nodes are there in Full ternary tree than a complete ternary tree?**

A) 1

B) 2

C) 3**D) Both have same number of nodes**

Explanation: Any complete ternary tree is a full ternary tree. As a result, they both have the same number of nodes.

A ternary tree is a tree data structure in which each node has a maximum of three child nodes, which are typically labelled “left,” “middle,” and “right.” Parent nodes have children, and child nodes may have references to their parents. If the “root” node (the ancestor of all nodes) exists, it is often mentioned outside the tree. Starting at the root node and repeatedly following references to the left, mid, or right kid, you can get to any node in the data structure. Ternary trees are used to build Ternary heaps and Ternary search trees.