60. 计算三叉搜索树的高度

const readline = require('readline');
const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
});

const tree = new Tree();
let root = null;
rl.on('line', function(line) {
    rl.on('line', (nums) => {
        nums.split(' ').forEach(num => {
            root = tree.insert(root, parseInt(num));
        });
        const height = tree.getHeight(root);
        console.log(height);
    })
});

class TreeNode {
    constructor(val) {
        this.val = val;
        this.left = null;
        this.mid = null;
        this.right = null;
    }
}

class Tree {
    insert(root, val) {
        if (root === null) {
            return new TreeNode(val);
        }
        if (val < root.val - 500) {
            root.left = this.insert(root.left, val);
        } else if (val > root.val + 500) {
            root.right = this.insert(root.right, val);
        } else {
            root.mid = this.insert(root.mid, val);
        }
        return root;
    }

    getHeight(root) {
        if (root === null) {
            return 0;
        }
        let leftHeight = this.getHeight(root.left);
        let rightHeight = this.getHeight(root.right);
        let midHeight = this.getHeight(root.mid);
        return Math.max(leftHeight, midHeight, rightHeight) + 1;
    }
}