BST Insert

import java.util.*;
class BstInsert{
    public static void main(String args[]){
        Node node = null;
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the size and keys to insert in BST");
        int len = sc.nextInt();
        int arr[] = new int[len];
        for(int x = 0; x < len; x++){
            arr[x] = sc.nextInt();
            node = insert(node, arr[x]);
        }

        while(true){
            System.out.println("Press 1 for insertion");
            System.out.println("Press 2 for traversal");
            System.out.println("Press 3 to stop");
            int x = sc.nextInt();
            if(x == 1){
                System.out.println("Enter the key");
                insert(node, sc.nextInt());

            }
            if(x == 2){
                traverse(node);
            }
            if(x == 3){
                break;
            }
        }

    }

    static Node insert(Node node, int key){
        if(node == null){
            node = new Node(key);
            return node;
        }
        if(key < node.key){
            node.left = insert(node.left, key);
        }
        else if(key > node.key){
            node.right = insert(node.right, key);
        }
        return node;
    }

    static void traverse(Node node){
        if(node != null){
            traverse(node.left);
            System.out.println(node.key);
            traverse(node.right);
        }
    }

}