Function dfs

javascript/0110-balanced-binary-tree.js:39–46

(root)

};

var dfs = (root) => {
    const left = getHeight(root.left);
    const right = getHeight(root.right);

    const height = Math.max(left, right);

    return height + 1;
};

/**
 * https://leetcode.com/problems/balanced-binary-tree/