Coding Simplified's video: BST - 16: Find Lowest Common Ancestor LCA for given values in Binary Search Tree

Source Code: https://thecodingsimplified.com/find-lowest-common-ancestor-lca-for-given-values-in-bst Solution - Traverse BST from root - For a node, if node.data is less than both n1 & n2, then I should go in right direction to check LCA, so node = node.right - For a node, if node.data is greater than both n1 & n2, then I should go in left direction to check LCA, so node = node.right - else current node will be LCA Time Complexity: O(n) Space Complexity: O(1) For more info, please see the video. CHECK OUT CODING SIMPLIFIED https://www.youtube.com/codingsimplified ★☆★ VIEW THE BLOG POST: ★☆★ http://thecodingsimplified.com I started my YouTube channel, Coding Simplified, during Dec of 2015. Since then, I've published over 500+ videos. ★☆★ SUBSCRIBE TO ME ON YOUTUBE: ★☆★ https://www.youtube.com/codingsimplified?sub_confirmation=1 ★☆★ Send us mail at: ★☆★ Email: thecodingsimplified@gmail.com