GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesFamily Tree Depth

Gamified challenge · Recursion

Family Tree Depth

The family tree is a binary tree: each person has at most two children. It arrives as tree, a TreeNode root (in the examples it is written in level order, with null for a missing child).

Write maxDepth(tree) (Python: max_depth(tree)) that returns how many generations the tree spans: the number of people on the longest line from the founder down to a person with no children. An empty tree spans 0 generations, a lone founder 1.

For [3, 9, 20, null, null, 15, 7] the answer is 3: 3 → 20 → 15.

Sign in to play Family Tree Depth

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account