public void Add(BTElement <K, V> e) { if (e.key.CompareTo(value.key) < 0) { if (left == null) { left = Util.Singleton(e); } else { left.Add(e); } } else { if (right == null) { right = Util.Singleton(e); } else { right.Add(e); } } }
public static BinaryTree <K, V> Singleton <K, V>(BTElement <K, V> e) where K : IComparable <K> { return(new BinaryTree <K, V>() { value = e }); }