Maximum Depth of Binary Tree at Uber

Easy77.9% acceptance

This problem has 62.5% frequency at Uber.

Problem Description

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.

Read full problem and hints

Topics

Tree Depth-First Search Breadth-First Search Binary Tree

Also asked at 15 companies

Accenture Amazon Apple Arista Networks Avito Bloomberg Google Infosys LinkedIn Meta Microsoft Oracle Qualcomm Spotify Yahoo

View Full Problem

Problem Description

Topics

Also asked at 15 companies

More Uber Questions