public RandomTreeNode Find(int k) { if (k == key) { return(this); } if (k < key) { return(left?.Find(k)); } else { return(right?.Find(k)); } }
public RandomTreeNode Find(int key) { return(root?.Find(key)); }
public RandomTreeNode Find(int k) { if (k == key) { return(this); } if (k < key) { return(left?.Find(k)); } else { return(right?.Find(k)); } }
public RandomTreeNode Find(int key) { return(root?.Find(key)); }