BST Insert

class Node {
    constructor(val){
        this.right = null
        this.left = null
        this.value = val
    }
}

function insert(node, val){
    if(!node) return new Node(val)

    if(node.value < val){
        node.right = insert(node.right, val);
    } else {
        node.left = insert(node.left, val);
    }

    return node
}

function traverse(node){
    if(node == null) return

    process.stdout.write(node.value.toString()+" ")

    traverse(node.left)
    traverse(node.right)
}


function processData(input) {
    // process input
    input = input.split(" ")
    input[0] = input[0].split("\n")[1]

    input = input.map(v => Number(v))

    let root = null

    // console.log(input)
    input.forEach(v => {
        root = insert(root, v)
    })
    traverse(root)
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
   processData(_input);
});