Data Structure Implementation | Dataford Interview Questions

Write a function to handle a specific data structure, such as a linked list or tree.

Implement lowest_common_ancestor(root, p, q) for a binary search tree with unique integer values. Each node is represented as a dictionary with val, left, and right keys, and missing children are null. Return the integer value of the lowest node that is an ancestor of both p and q.

Assume both target values exist in the tree. Use the BST ordering property where possible.

Constraints

1 <= number of nodes <= 1000
Node values are unique integers
Both p and q exist in the tree
The input is a valid binary search tree
Missing children are represented by null

Function Signature

def lowest_common_ancestor(root, p, q):

Your question is Data Structure Implementation. 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

Write a function to handle a specific data structure, such as a linked list or tree.

Assume both target values exist in the tree. Use the BST ordering property where possible.

Constraints

1 <= number of nodes <= 1000
Node values are unique integers
Both p and q exist in the tree
The input is a valid binary search tree
Missing children are represented by null

Function Signature

def lowest_common_ancestor(root, p, q):

Your question is Data Structure Implementation. 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.