Description:

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.

My code:

/**
 * 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) {
    // function depth(layer, tree) 判斷是否為null, 不是的話遞歸調(diào)用depth(), 記錄父節(jié)點的左右節(jié)點，比較左右節(jié)點的深度，返回較大的
    if(root == null) {
        return 0;
    }
    let left = maxDepth(root.left);
    let right = maxDepth(root.right);
    if(left >= right) {
        return ++left;
    } else {
        return ++right;
    }
};