public class BinarySearchTree {
    class Node{
        Node lChild;
        Node rChild;
        int data;
        public Node(int data) this.data=data;
    }

    Node root;
    public void insert(int data){

        Node node=new Node(data);
        if(root==null){
            root=node;
        }
        else{
            Node parent;
            Node focus=root;
            while(true) {
                parent=focus;
                if (node.data < focus.data) {
                    focus = focus.lChild;
                    if(focus==null){
                        parent.lChild=node;
                        return;
                    }
                }
                else {
                    focus = focus.rChild;
                    if(focus==null){
                        parent.rChild=node;
                    }
                }
            }
        }

    }
    public void inOrderTraversal(Node temp){
        if (temp!=null){

            inOrderTraversal(temp.lChild);
            System.out.println(temp.data);
            inOrderTraversal(temp.rChild);

        }
    }
    public void preOrderTraversal(Node temp){
        if(temp!=null){

            System.out.println(temp.data);
            preOrderTraversal(temp.lChild);
            preOrderTraversal(temp.rChild);

        }
    }
    public void postOrderTraversal(Node temp){

        if(temp!=null){
            postOrderTraversal(temp.lChild);
            postOrderTraversal(temp.rChild);
            System.out.println(temp.data);
        }
    }

    public Node findNode(int value){
        Node temp=root;
        while(temp.data!=value){
            if(value<temp.data){
                temp=temp.lChild;
            }
            else{
                temp=temp.rChild;
            }
            if(temp==null){
             return null;
            }
        }
        return temp;
    }


}