public void CreateTree()
 {
     rootchar                  = new NodeChar('P');
     rootchar.left             = new NodeChar('A');
     rootchar.left.left        = new NodeChar('S');
     rootchar.left.right       = new NodeChar('E');
     rootchar.left.left.left   = new NodeChar('T');
     rootchar.left.left.right  = new NodeChar('Q');
     rootchar.left.right.left  = new NodeChar('D');
     rootchar.right            = new NodeChar('X');
     rootchar.right.left       = new NodeChar('M');
     rootchar.right.right      = new NodeChar('R');
     rootchar.right.right.left = new NodeChar('C');
 }
 public BinarySearchTree()
 {
     rootchar = null;
     rootInt  = null;
 }