[LeetCode] 235. Lowest Common Ancestor of a Binary Search Tree - 문제풀이 Description 이진검색트리에서 주어진 두 노드의 가장 최하위 공통 조상 LCA를 찾아 반환하는 문제입니다. 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).” E.. 알고리즘/LeetCode 2022. 2. 14. 17:47
