Пример #1
0
 private T ElementAt(BinaryNode <T> n) => n == null ? default(T) : n.Element;
Пример #2
0
 public RankedBinarySearchTree(BinaryNode <T> root) : base(root)
 {
 }
Пример #3
0
 public void RemoveMin()
 {
     Root = RemoveMin(Root);
 }
Пример #4
0
 public void Remove(T x)
 {
     Root = Remove(x, Root);
 }
Пример #5
0
 public void Insert(T x)
 {
     Root = Insert(x, Root);
 }
Пример #6
0
 public void MakeEmpty()
 {
     Root = null;
 }
Пример #7
0
 public BinarySearchTree(BinaryNode <T> root)
 {
     Root = root;
 }