public BinarySearchTree(int rootValue) { Root = new BinaryNode(rootValue); }
private string SimpleTraverse(BinaryNode current) { return(current == null ? "" : SimpleTraverse(current.LeftChild) + " " + current.Value + " " + SimpleTraverse(current.RightChild)); }