leetcode104. 二叉树的最大深度

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxDepth = function(root) {
    return computedDepeth(root,0)
};
var computedDepeth = function(root,deep){
    if(root == null) return deep;
    return Math.max(computedDepeth(root.left,deep+1),computedDepeth(root.right,deep+1))
}