public BinarySearchTreeNode Insert(BinarySearchTreeNode binarySearchTreeNode, int data) { if (binarySearchTreeNode == null) { binarySearchTreeNode = new BinarySearchTreeNode(data); return(binarySearchTreeNode); } if (binarySearchTreeNode.GetBinarySearchTreeNodeData() < data) { binarySearchTreeNode.SetBinarySearchNodeRight( Insert(binarySearchTreeNode.GetBinarySearchTreeNodeRight(), data)); } else { binarySearchTreeNode.SetBinarySearchNodeLeft( Insert(binarySearchTreeNode.GetBinarySearchTreeNodeLeft(), data)); } return(binarySearchTreeNode); }
public void SetBinarySearchNodeRight(BinarySearchTreeNode binarySearchTreeNode) { right = binarySearchTreeNode; }
public void SetBinarySearchNodeLeft(BinarySearchTreeNode binarySearchTreeNode) { left = binarySearchTreeNode; }
public void SetBinarySearchTreeRoot(BinarySearchTreeNode binarySearchTreeNode) { root = binarySearchTreeNode; }
public BinarySearchTree(BinarySearchTreeNode binarySearchTreeNode) { root = binarySearchTreeNode; }