Airbnb OA Question 2024 July | Trees | on-campus

Question · Posted Jun 2026

Question: Maximum Depth of Binary Tree Problem Statement 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. Constraints The number of nodes in the tree is in the range [0, 104]. -100 <= Node.val <= 100 Examples Example 1: Input: root = [3,9,20,null,null,15,7] Output: 3 Explanation 1: The tree has 3 levels. The longest ...

The full answer & interview discussion are available to premium members.

Log in Create a free account