Home » MCQs » Discrete Mathematics MCQs

Discrete Mathematics | Binary Trees MCQs

Discrete Mathematics | Binary Trees MCQs: This section contains multiple-choice questions and answers on Binary Trees in Discrete Mathematics.
Submitted by Anushree Goswami, on October 23, 2022

1. In a directed tree, a ____ tree is one in which every node has an outdegree less than or equal to two?

1. Non-binary
2. Less binary
3. Partial binary
4. Binary

Answer: D) Binary

Explanation:

In a directed tree, a binary tree is one in which every node has an outdegree less than or equal to two.

---

2. A binary tree consisting only of ____ (empty tree) is also a binary tree?

1. Edges
2. Points
3. Nodes
4. Vertex

Answer: C) Nodes

Explanation:

A binary tree consisting only of nodes (empty tree) is also a binary tree.

---

3. There is a unique node in a binary tree called its ____?

1. Parent
2. Left child
3. Right child
4. Root

Answer: D) Root

Explanation:

There is a unique node in a binary tree called its root.

---

4. There is a node to the ____ of the root called its left child?

1. Left
2. Right
3. Center
4. None

Answer: A) Left

Explanation:

There is a node to the left of the root called its left child.

---

5. Nodes that are ____ of a root are called its right children?

1. Center
2. Left
3. Right
4. None

Answer: C) Right

Explanation:

Nodes that are right of a root are called its right children.

---

6. Nodes that have ____ are called their parents?

1. Left Children
2. Right Children
3. Both left and right children
4. All of the above

Answer: D) All of the above

Explanation:

Nodes that have left or right children or both are called their parents.

---

7. It is called a sibling node when two nodes have the ____ parent?

1. Same
2. Different
3. Neighbour
4. None

Answer: A) Same

Explanation:

It is called a sibling node when two nodes have the same parent.

---

8. It is called a leaf if it has __ children?

1. One
2. Two
3. Multiple
4. No

Answer: D) No

Explanation:

It is called a leaf if it has no children.

---

9. There can be as few as ____ leaf (minimum) or as many as half the number of vertices (maximum) in a binary tree?

1. Zero
2. One
3. Two
4. Three

Answer: B) One

Explanation:

There can be as few as one leaf (minimum) or as many as half the number of vertices (maximum) in a binary tree.

---

10. When a node is the child of another node or a child of another descendant of another node, it is called a ____?

1. Ascendant
2. Descendant
3. Both A and B
4. None of the above

Answer: B) Descendant

Explanation:

When a node is the child of another node or a child of another descendant of another node, it is called a descendant.

---

11. In a tree, all nodes are descendants of the ___?

1. Leaf
2. Root
3. Stem
4. Flower

Answer: B) Root

Explanation:

In a tree, all nodes are descendants of the root.

---

12. Left subtrees are those whose roots are the ___ children of a node?

1. Left
2. Right
3. Middle
4. None

Answer: A) Left

Explanation:

Left subtrees are those whose roots are the left children of a node.

---

13. Right subtrees of nodes have their roots in the ____ child of that node?

1. Left
2. Right
3. Middle
4. None

Answer: B) Right

Explanation:

Right subtrees of nodes have their roots in the right child of that node.

---

14. A node's ____ is determined by its distance from the root?

1. Depth
2. Level
3. Quantity
4. Quality

Answer: B) Level

Explanation:

A node's level is determined by its distance from the root.

---

15. Root has a ____ level?

1. Zero
2. One
3. Two
4. Three

Answer: A) Zero

Explanation:

Root has a zero level.

---

16. Nodes beneath its parent have a level ____ than its own?

1. One Higher
2. Two Higher
3. Zero Higher
4. One Lower

Answer: A) One Higher

Explanation:

Nodes beneath its parent have a level one higher than its own.

---

17. Any level N can have a maximum of ___ nodes?

1. N²
2. 2^N
3. 2^N-2
4. 2^N-1

Answer: B) 2^N

Explanation:

Any level N can have a maximum of 2^Nnodes.

---

18. An object's ____ refers to its maximum number of nodes in a branch?

1. Depth
2. Height
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

An object's depth or height refers to its maximum number of nodes in a branch.

---

19. Binary trees of depth d can have a maximum number of nodes of ___, where d ≥1?

1. 2^d
2. 2^d+1
3. 2^d-1
4. 2d-1

Answer: C) 2^d-1

Explanation:

Binary trees of depth d can have a maximum number of nodes of 2^d-1, where d ≥1.

---

20. ____ nodes are nodes without children?

1. External
2. Terminal
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

External nodes or terminal nodes are nodes without children.

---

21. A node that has one or more children is called a/an ____?

1. Internal
2. Non-terminal
3. Both A and B
4. None of the above

Answer: C) Both A and B

Explanation:

A node that has one or more children is called an internal node or a non-terminal node.

---

22. An ____ tree consists of a root containing the operator, a left subtree containing the left expression, and a right subtree containing the right expression?

1. Experience
2. Expression
3. Extravange
4. Attribute

Answer: B) Expression

Explanation:

An expression tree consists of a root containing the operator, a left subtree containing the left expression, and a right subtree containing the right expression.

---

23. Binary trees with the maximum number of possible nodes at every level, except perhaps the last, are considered ____?

1. Binary trees
2. Incomplete binary trees
3. Complete binary trees
4. Partially complete binary trees

Answer: C) Complete binary trees

Explanation:

Binary trees with the maximum number of possible nodes at every level, except perhaps the last, are considered complete binary trees.

---

24. Binary trees with full leaves and two children for non-leaf nodes are called ___ binary trees?

1. Half
2. Full
3. Non-empty
4. Null

Answer: B) Full

Explanation:

Binary trees with full leaves and two children for non-leaf nodes are called full binary trees.

---

25. Which of the following is TRUE about General Tree?

1. It is possible for the general tree to be empty.
2. There are two types of children for a node: left children and right children.
3. There is no distinction between a node that has children and a node that does not have children.
4. None of the above

Answer: C) There is no distinction between a node that has children and a node that does not have children

Explanation:

There is no distinction between a node that has children and a node that does not have children.

---

26. Which of the following is TRUE about Binary Tree?

1. There is no distinction between a node that has children and a node that does not have children.
2. An empty binary tree or a tree with zero nodes does not exist.
3. It is possible for the binary tree to be empty.
4. There is only one type of children for a node: left children or right children.

Answer: C) It is possible for the binary tree to be empty

Explanation:

It is possible for the binary tree to be empty.

---

---