算法系列（17） Leetcode 104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

思路：这个是在网上找的答案，所以归纳为转载，有关二叉树真的不会。。。但是这又应该是个重点。如果不是root的话，就要继续往下看增加maxn，如果是根结点，就要接着看是否有子节点，有则深度增加

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