Given a binary search tree and two nodes p and q, find their lowest common ancestor (LCA). The LCA is the lowest node that has both p and q as descendants (a node can be a descendant of itself). Example: In a BST with root , if p = and q = , the LCA is . If p = and q = , the LCA is .
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/trees-bst/problem-lowest-common-ancestor-of-bst
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████████