arrow_back Back to Challenges

#235 Lowest Common Ancestor of a Binary Search Tree

Medium Acceptance 0%
description

Problem Description

Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST.

checklist Constraints

See problem description for detailed constraints.

science Examples

Case #1

In: # See problem description for input format
Out: # Expected output

Mastery Tags

Binary Search Trees

Hiring Companies

Amazon Apple
code

Integrated IDE

code_blocks
Coding
psychology
Aptitude