Lowest Common Ancestor of a BST - LeetCode 235 - JavaScript

preview_player
Показать описание


Step by step walk through of the solution to the popular Meta coding interview question, Lowest Common Ancestor of a BST.

LeetCode 235

JavaScript

0:00 Intro
1:01 Explanation
4:54 Code

#softwareengineering #javascript #leetcode
Рекомендации по теме
Комментарии
Автор

Thank you so much! Liked and subscribed 🙏🏾❤️

alexandremachado
Автор

This got upgraded to medium difficulty since you posted this.

amtkyo
Автор

Very nice, one of the best recursive examples

wabbit
Автор

Nice explanation. Very clear! Thank you.

melanieprevot
Автор

Awesome solution. This was really helpful for me!

LSUHEBERT
Автор

Great video, subscribed 💚.
And may I ask a question?
How do you write this in JavaScript when it's not available in the JavaScript category?
What i mean is that whenever i click on the JavaScript questions there are only around 20 30 questions and no sign of this question that you're solving.

bandekhoda-rand
Автор

Thank you for your explanation, really helps me a lot. <3

derso
Автор

Can’t we do a binary search for the node that is between p and q ? - that way it would be O(log N)

brianspinos
Автор

What if p == q? I think it wouldn’t work

renanmatulianes