The Family Reunion

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Given the root of a binary search tree (as nested dicts with 'val', 'left', 'right') and two integer values p and q present in the BST, return the value of their lowest common ancestor.

Summary

Two cousins share a common ancestor somewhere above.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.