Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Trees

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Trees

Maximum Depth of Binary Tree

beginnerlayer I1 · Trees5 tests

Given the root of a binary tree, return its depth: the number of nodes on the longest path from the root down to any leaf.

  • An empty tree (null root) has depth 0
  • A tree with only a root has depth 1
  • build(arr) turns a level-order array (with null for a missing child) into a tree

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen