Find lowest common ancestor in Binary Search Tree

Question

I\'ve got the following code to find the lowest common ancestor (the lowest node that has both a and b as descendants):

public static Node LCA(Node root, Node a,          


        

Answer 1

Does IData have the equality operator (==) defined? If not, you are just comparing the references and not the object themselves.

This explains it fairly well: http://www.ikriv.com/en/prog/info/dotnet/ObjectEquality.html