C# (CSharp) Trees.BinarySearchTree BinaryNode Examples

Example #1

 public BinarySearchTree(int rootValue)
 {
     Root = new BinaryNode(rootValue);
 }

Example #2

 private string SimpleTraverse(BinaryNode current)
 {
     return(current == null ? "" : SimpleTraverse(current.LeftChild) + " " + current.Value + " " + SimpleTraverse(current.RightChild));
 }