Binary tree terminology in Data Structures Theory - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding Binary Tree Node Relationships

In a binary tree, what is the term used for a node that has no children?

A Root node

B Parent node

C Leaf node

D Sibling node

💡 Hint

Think about the nodes at the very end of the tree branches.

A leaf node is a node that does not have any children. It is at the end of a branch in the tree.

📋 Factual

intermediate

Binary Tree Height Definition

What does the height of a binary tree represent?

A The number of nodes in the tree

B The number of edges on the longest path from the root to a leaf

C The number of leaf nodes

D The number of children a node has

💡 Hint

Height measures the longest distance from the top to the bottom of the tree.

The height of a binary tree is the number of edges on the longest path from the root node down to the farthest leaf node.

🔍 Analysis

advanced

Identifying Node Types in a Binary Tree

Consider a node in a binary tree that has exactly two children. What is the correct term for this node?

A Internal node

B Leaf node

C Root node

D Sibling node

💡 Hint

This node is not at the end of a branch and has children.

An internal node is any node in a binary tree that has at least one child. A node with two children is an internal node.

❓ Comparison

advanced

Difference Between Depth and Height in Binary Trees

Which statement correctly describes the difference between the depth and height of a node in a binary tree?

A Depth and height are the same and measure the distance from the root.

B Depth is the number of children a node has; height is the number of siblings.

C Depth is the number of leaf nodes; height is the total number of nodes.

D Depth is the number of edges from the node to the root; height is the number of edges from the node to the farthest leaf.

💡 Hint

Think about how far a node is from the top and how far it is from the bottom.

Depth measures how far a node is from the root (top), while height measures how far it is from the farthest leaf (bottom).

❓ Reasoning

expert

Calculating Number of Nodes in a Perfect Binary Tree

What is the total number of nodes in a perfect binary tree of height 3?

A 15

B 7

C 8

D 31

💡 Hint

A perfect binary tree has all levels fully filled. Use the formula for total nodes: 2^(height+1) - 1.

For height 3, total nodes = 2^(3+1) - 1 = 2^4 - 1 = 16 - 1 = 15 nodes.

Practice

1. In a binary tree, what do we call the topmost node that has no parent?

easy

A. Root

B. Leaf

C. Internal node

D. Child

Solution

1. Step 1: Understand the position of nodes in a binary tree

   The topmost node in a binary tree is the starting point and has no parent node above it.

2. Step 2: Identify the term for the topmost node

   This node is called the root because it is the base from which all other nodes branch out.

3. Final Answer:

   Root -> Option A

4. Quick Check:

   Top node = Root [OK]

Hint: Top node with no parent is always the root [OK]

Common Mistakes:

• Confusing root with leaf
• Thinking root has a parent
• Calling root a child

2. Which of the following correctly describes a leaf node in a binary tree?

easy

A. The topmost node

B. A node with exactly two children

C. A node with one child

D. A node with no children

Solution

1. Step 1: Recall the definition of a leaf node

   A leaf node is a node that does not have any children, meaning it is at the end of a branch.

2. Step 2: Match the definition with the options

   A node with no children states the node has no children, which matches the leaf node definition.

3. Final Answer:

   A node with no children -> Option D

4. Quick Check:

   Leaf node = no children [OK]

Hint: Leaf nodes have zero children, no branches below [OK]

Common Mistakes:

• Thinking leaf has children
• Confusing leaf with root
• Assuming leaf has one child

3. Consider this binary tree node description:
Node A has two children: Node B (left) and Node C (right). Node B has no children. Node C has one child: Node D (left).
Which of these nodes is an internal node?

medium

A. Node B only

B. Node D only

C. Node A and Node C

D. Node A only

Solution

1. Step 1: Define internal nodes

   Internal nodes have at least one child. Leaf nodes have none.

2. Step 2: Analyze each node's children

   Node A has two children (B and C), so it is internal. Node B has no children, so it is a leaf. Node C has one child (D), so it is internal. Node D has no children, so it is a leaf.

3. Final Answer:

   Node A and Node C -> Option C

4. Quick Check:

   Internal nodes = nodes with children [OK]

Hint: Internal nodes have one or two children, leaves have none [OK]

Common Mistakes:

• Calling leaf nodes internal
• Ignoring nodes with one child
• Confusing node labels

4. Identify the error in this statement about binary trees:
"A leaf node can have one child."

medium

A. Leaf nodes cannot have any children, so the statement is false.

B. Leaf nodes are always the root, so the statement is false.

C. Leaf nodes can have two children, so the statement is false.

D. Leaf nodes must have exactly one child, so the statement is true.

Solution

1. Step 1: Recall the definition of a leaf node

   A leaf node is defined as a node with no children at all.

2. Step 2: Evaluate the statement

   The statement says a leaf node can have one child, which contradicts the definition. Therefore, the statement is false.

3. Final Answer:

   Leaf nodes cannot have any children, so the statement is false. -> Option A

4. Quick Check:

   Leaf node = no children [OK]

Hint: Leaf nodes have zero children, never one [OK]

Common Mistakes:

• Thinking leaf can have children
• Confusing leaf with internal node
• Misunderstanding node roles

5. You have a binary tree where every internal node has exactly two children, and all leaves are at the same depth. What is this type of binary tree called?

hard

A. Complete binary tree

B. Perfect binary tree

C. Balanced binary tree

D. Full binary tree

Solution

1. Step 1: Understand the definitions of binary tree types

   A full binary tree has every node with 0 or 2 children. A complete binary tree is filled level by level left to right. A balanced binary tree has heights of subtrees differ by at most one. A perfect binary tree is full and all leaves are at the same depth.

2. Step 2: Match the given conditions

   The tree described has every internal node with exactly two children (full) and all leaves at the same depth, which matches the perfect binary tree definition.

3. Final Answer:

   Perfect binary tree -> Option B

4. Quick Check:

   Full + all leaves same depth = Perfect tree [OK]

Hint: Full + all leaves same depth = Perfect binary tree [OK]

Common Mistakes:

• Confusing complete with perfect
• Mixing balanced with perfect
• Ignoring leaf depth condition