實現一棵二叉查找樹的數據結構

public class Main {

    static class Node {
        public int val;
        public Node left;
        public Node right;
        public Node(int val){
            this.val = val;
        }
    }

    public static void main(String[] args) {
        Node root = new Node(10);
        inputVal(root,8);
        inputVal(root,15);
        inputVal(root,1);
        inputVal(root,4);
        inputVal(root,25);
        inputVal(root,43);
    }

    public static void inputVal(Node root,int val){
        if(root.val>val&&root.left==null){
            root.left = new Node(val);
        }else if(root.val<val&&root.right==null){
            root.right = new Node(val);
        }else{
            if(root.val>val){
                inputVal(root.left,val);
            }else{
                inputVal(root.right,val);
            }
        }
        return;
    }
}