//Add a node to Binary Tree public void Add(int value) { if (Root == null) { BinaryTreeNode node = new BinaryTreeNode() {Value = value}; Root = node; } else { var root = Root; while (root != null) { if (value >= root.Value) { if (root.Right == null) { root.Right = new BinaryTreeNode() { Value = value }; return; } else { root = root.Right; } } else { if (root.Left == null) { root.Left = new BinaryTreeNode() { Value = value }; return; } else { root = root.Left; } } } } }
private void TraversPreOrder(BinaryTreeNode root) { if (root != null) { Console.WriteLine(root.Value); TraversPreOrder(root.Left); TraversPreOrder(root.Right); } }
public void TraversPostOrder(BinaryTreeNode root) { if (root != null) { TraversPostOrder(root.Left); TraversPostOrder(root.Right); Console.WriteLine(root.Value); } }