二叉树深度

function dfs(root) {
    if (!root) {
        return 0
    }else {
        var leftDepth = dfs(root.left);
        var rightDepth = dfs(root.right);
        var childDepth = leftDepth > rightDepth ? leftDepth : rightDepth;
        return childDepth + 1
    }
}