30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 235. Lowest Common Ancestor of a Binary Search Tree

Given a BST and two nodes p and q, find their lowest common ancestor — the deepest node that is an ancestor of both. Leverage BST ordering to traverse from the root until you reach the first node where p and q fall on different sides (or equal the node), which is the LCA.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid September, 2025

Senior

Late July, 2025

Senior

Early April, 2025

Mid-level

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 235. Lowest Common Ancestor of a Binary Search Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact