Skip to Content
PracticeProblems.org

Coding Interviews: Simple Data Structures

Collapse
All Coding InterviewsSimple Data StructuresSearching and SortingArrays and StringsStacks and QueuesGreedy AlgorithmsDynamic ProgrammingGraphsComplex Data StructuresMathMiscellaneousSystem Design
Maximum Depth of Binary Tree

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Simple Data StructuresEasyVideoCode SolutionJava