tag:blogger.com,1999:blog-5013829528944984059.post1770398930581905748..comments2024-03-28T22:50:54.940-07:00Comments on Open Source For Geeks: Lowest Common Ancestor in a Binary Search Tree.Aniket Thakurhttp://www.blogger.com/profile/07553743551249736583noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-5013829528944984059.post-33453196934953785592014-06-01T13:48:27.187-07:002014-06-01T13:48:27.187-07:00What if n1 or n2 not present in the tree.
Add this...What if n1 or n2 not present in the tree.<br />Add this check before returning root in line 22.<br /><br />if( k1 >= min(root) && k2 <= max(root))<br />return root;<br />else<br />return null;Android Tutorials|Examples|Discussionhttps://www.blogger.com/profile/06333708070270784588noreply@blogger.com