235.Lowest Common Ancestor of a Binary Search Tree || Code + Explanation || Leetcode Daily Challenge

preview_player
Показать описание
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”

Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.

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

This way of solving is Epic. Thank You Alisha

boyncode
Автор

thank you ma'am!!
May i get your linkedin id?

Vikashp-ol