We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
publicstaticNodeTreelca(NodeTreeroot,intv1,intv2){// Write your code here.if(root==null){returnroot;}intlarger=Math.Max(v1,v2);intsmaller=Math.Min(v1,v2);if(root.Data>=smaller&&root.Data<=larger){Console.Write(root.Data);returnroot;}if(root.Data<smaller){Console.Write(root.RightNode);returnlca(root.RightNode,v1,v2);}Console.Write(root.LeftNode);returnlca(root.LeftNode,v1,v2);}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Binary Search Tree : Lowest Common Ancestor
You are viewing a single comment's thread. Return to all comments →
Solution C#