Binary Tree Depth Function | Dataford Interview Questions

Given a binary tree, write a function to determine its depth.

Represent each node as [value, left, right], where a missing child is null, and return the number of nodes on the longest root-to-leaf path. Return 0 for an empty tree; for example, [1, [2, null, null], [3, null, null]] has depth 2.

Constraints

The tree contains at most 10^4 nodes.
Each node is represented as [value, left, right].
A missing child is represented by null.
Depth is measured by the number of nodes on the longest root-to-leaf path.

Function Signature

def max_depth(root):

Your question is Binary Tree Depth Function. 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

Given a binary tree, write a function to determine its depth.

Constraints

The tree contains at most 10^4 nodes.
Each node is represented as [value, left, right].
A missing child is represented by null.
Depth is measured by the number of nodes on the longest root-to-leaf path.

Function Signature

def max_depth(root):

Your question is Binary Tree Depth Function. 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.