Lowest Common Ancestor of a Binary Search Tree - LeetCode 235 - Python

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

Explaining Lowest Common Ancestor of a Binary Search Tree in Python

@1:33 - Problem walk-through
@2:10 - meant to say "it is a direct OR INDIRECT ancestor of every node"
@5:41 - Code
@-8:08-Time and Space Complexity
@8:57 - Code walk-through

Music: Bensound

Lemme know if you have ANY questions or comments at alll!:)
Рекомендации по теме
Комментарии
Автор

great video, this should help me stop getting the lowest score on common LeetCode questions and disappointing my ancestors

Derpthemeus
Автор

Your lovely videos keep pouring in . Keep it going

deepakjyoti
Автор

Make video on finding the nodes at a distance of k from a given node in a Binary Tree

sushanthtodupunuri
Автор

Why are we writing a return on if and elif? return should only be on else right? Why is return needed on above 2 cases?

stutiadarsh
Автор

Beauty of an explanation by a beauty .

deepakjyoti