Binary Tree Depth Problem | Dataford Interview Questions

Solve a problem involving binary trees, such as finding the depth of a binary tree. Represent each node as a dictionary with val, left, and right keys, using null for missing children. Implement max_depth(root) to return the number of nodes on the longest path from the root to a leaf. Return 0 when root is null.

Constraints

0 <= number of nodes <= 1000
Each node is a dictionary with keys val, left, and right
left and right are either null or valid child nodes
Node values may be any integer

Function Signature

def max_depth(root):

Your question is Binary Tree Depth Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

0 <= number of nodes <= 1000
Each node is a dictionary with keys val, left, and right
left and right are either null or valid child nodes
Node values may be any integer

Function Signature

def max_depth(root):

Your question is Binary Tree Depth Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.