Height and depth of trees in Data Structures Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the sentence to define the depth of a node in a tree.

Data Structures Theory

The depth of a node is the number of edges from the root to the [1] node.

Drag options to blanks, or click blank then click option'

Aparent

Bleaf

Croot

Dtarget

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing depth with height.

Thinking depth counts edges from the node to the leaves.

The depth of a node is counted from the root down to the target node itself.

2fill in blank

medium

Complete the sentence to define the height of a node in a tree.

Data Structures Theory

The height of a node is the number of edges on the longest path from the node to a [1].

Drag options to blanks, or click blank then click option'

Aroot

Bparent

Cleaf

Dsibling

Attempts:

3 left

💡 Hint

Common Mistakes

Mixing up height and depth definitions.

Thinking height counts edges up to the root.

The height of a node measures the longest path down to a leaf node.

3fill in blank

hard

Fix the error in the statement about tree height.

Data Structures Theory

The height of the root node is always [1].

Drag options to blanks, or click blank then click option'

A0

Bequal to the depth of the tree

Cequal to the number of nodes

D1

Attempts:

3 left

💡 Hint

Common Mistakes

Assuming height is always 1 for the root.

Confusing height with depth.

The height of the root node is equal to the height of the tree, which is the longest path from the root to a leaf node.

4fill in blank

hard

Fill both blanks to complete the dictionary comprehension that maps nodes to their depths.

Data Structures Theory

depths = {node: [1] for node in nodes if node [2] root}

Drag options to blanks, or click blank then click option'

Adistance_from_root(node)

B==

C!=

Dis_leaf(node)

Attempts:

3 left

💡 Hint

Common Mistakes

Using equality instead of inequality to exclude root.

Using leaf check instead of distance calculation.

This comprehension assigns each node's depth by calculating its distance from the root, excluding the root itself.

5fill in blank

hard

Fill all three blanks to create a dictionary comprehension mapping nodes to their heights, excluding leaves.

Data Structures Theory

heights = {node: [1] for node in nodes if not [2] and node [3] root}

Drag options to blanks, or click blank then click option'

Aheight(node)

Bis_leaf(node)

C!=

Dis_root(node)

Attempts:

3 left

💡 Hint

Common Mistakes

Including leaves in the height calculation.

Confusing root exclusion condition.

This comprehension calculates the height for each node that is not a leaf and is not the root.