예제 #1
0
 public void Clear()
 {
     RootNode = new BinaryTreeNode <T>();
     Count    = 0;
 }
예제 #2
0
        public bool Contains(T value)
        {
            BinaryTreeNode <T> result = FindNodeByValue(RootNode, value);

            return(result != null);
        }
예제 #3
0
 public BinarySearchTree()
 {
     RootNode = new BinaryTreeNode <T>();
 }