binary tree in csharp

main.cs
class Node {
    public int value;
    public Node left;
    public Node right;

    public Node(int value) {
        this.value = value;
        this.left = null;
        this.right = null;
    }
}

class BinaryTree {
    public Node root;

    public BinaryTree() {
        this.root = null;
    }

    public void Insert(int value) {
        Node newNode = new Node(value);

        if (root == null) {
            root = newNode;
        }
        else {
            Node temp = root;

            while (temp != null) {
                if (value < temp.value) {
                    if (temp.left == null) {
                        temp.left = newNode;
                        break;
                    }
                    else {
                        temp = temp.left;
                    }
                }
                else if (value > temp.value) {
                    if (temp.right == null) {
                        temp.right = newNode;
                        break;
                    }
                    else {
                        temp = temp.right;
                    }
                }
                else {
                    break;
                }
            }
        }
    }

    public void TraverseInOrder(Node node) {
        if (node != null) {
            TraverseInOrder(node.left);
            Console.Write(node.value + " ");
            TraverseInOrder(node.right);
        }
    }

    public void TraversePreOrder(Node node) {
        if (node != null) {
            Console.Write(node.value + " ");
            TraversePreOrder(node.left);
            TraversePreOrder(node.right);
        }
    }

    public void TraversePostOrder(Node node) {
        if (node != null) {
            TraversePostOrder(node.left);
            TraversePostOrder(node.right);
            Console.Write(node.value + " ");
        }
    }
}
1878 chars
79 lines