public void Addtree(Ident node) //Adding a node in the tree by comparing indexes of nodes { Tree t = this; if (node.Hashcode < id.Hashcode) { if (left != null) { t.left.Addtree(node); } else { t.left = new Tree(node); } } else { if (right != null) { t.right.Addtree(node); } else { t.right = new Tree(node); } } }
public int CompareTo(object obj) { Ident ob = obj as Ident; if (ob != null) { double str = Hashcode; double str1 = ob.Hashcode; return(str.CompareTo(str1)); } return(0); }
Tree left, right; //right and left subtrees public Tree(Ident identificator = null) { id = identificator; left = null; right = null; }