Tree Terminology Root Leaf Height Depth Level in DSA C++ - Practice Problems & Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Identify the root node in a tree

In a tree data structure, which node is called the root?

A The node with the lowest height

B The node with no parent

C The node with no children

D The node with the highest depth

💡 Hint

Think about the starting point of the tree.

The root node is the topmost node in a tree and has no parent node.

❓ Predict Output

intermediate

Find the leaf nodes in a tree

Given the following tree nodes and their children, which nodes are leaves?

DSA C++

Node 1: children = [2, 3]
Node 2: children = [4]
Node 3: children = []
Node 4: children = []

A [1, 2]

B [1, 4]

C [2, 3]

D [3, 4]

💡 Hint

Leaves have no children.

Nodes 3 and 4 have no children, so they are leaves.

❓ Predict Output

advanced

Calculate the height of a node

What is the height of node 2 in the following tree? Structure: 1 ├─ 2 │ └─ 4 └─ 3

DSA C++

Height is the number of edges on the longest path from the node to a leaf.

A 0

B 2

C 1

D 3

💡 Hint

Count edges from node 2 down to its farthest leaf.

Node 2 has one child (4), which is a leaf. So height is 1 edge.

❓ Predict Output

advanced

Determine the depth of a node

What is the depth of node 4 in the tree below? Structure: 1 ├─ 2 │ └─ 4 └─ 3

DSA C++

Depth is the number of edges from the root to the node.

A 2

B 1

C 0

D 3

💡 Hint

Count edges from root (1) to node 4.

Path from root to node 4 is 1 -> 2 -> 4, which has 2 edges.

🧠 Conceptual

expert

Identify the level of a node in a tree

In a tree, what does the level of a node represent?

A The number of edges from the root plus one

B The number of children the node has

C The height of the node

D The number of leaf nodes in the subtree

💡 Hint

Level is closely related to depth but starts counting from 1.

Level is depth plus one, counting the root as level 1.