Binary Tree Basics | Dataford Interview Questions

Datadog may represent nested event relationships as a binary tree for lightweight traversal tasks. Given the root of a binary tree, return its maximum depth, defined as the number of nodes on the longest path from the root to any leaf.

Formal Specification

The input root is either null for an empty tree or a nested array of the form [value, left, right]. value is an integer, and left and right are either null or nested binary-tree arrays. Return an integer representing the tree's maximum depth.

Implement max_depth(root).

Constraints

0 <= number of nodes <= 10^4
-10^9 <= value <= 10^9
The input is a valid binary tree with no cycles

Function Signature

def max_depth(root):

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