public void Insert(int data) { if (Root == null) { Root = new SearchTreeNode(data); } var node = Root; while (node != null) { //这里暂且把等于该节点的值也插入左节点 if (data < node.Value) { if (node.LeftNode == null) { node.LeftNode = new SearchTreeNode(data); return; } node = node.LeftNode; } else if (data == node.Value) { // node.IsDeleted = false; } else if (data > node.Value) { if (node.RightNode == null) { node.RightNode = new SearchTreeNode(data); return; } node = node.RightNode; } } }
public BinarySearchTree(int value) { Root = new SearchTreeNode(value); }