二叉树 - 二叉树的最大深度

104. 二叉树的最大深度

方法一：递归遍历

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxDepth = function (root) {
    // 使用递归的方法 递归三部曲
    // 1. 确定递归函数的参数和返回值
    const getDepth = function (node) {
        // 2. 确定终止条件
        if (node === null) {
            return 0;
        }
        // 3. 确定单层逻辑
        let leftDepth = getDepth(node.left);
        let rightDepth = getDepth(node.right);
        let depth = 1 + Math.max(leftDepth, rightDepth);
        return depth;
    }
    return getDepth(root);
}

方法二：层级遍历

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maxDepth = function (root) {
    if (!root) return 0;
    let count = 0;
    const queue = [root];
    while (queue.length) {
        let size = queue.length;
        // 层数+1
        count++;
        while (size--) {
            let node = queue.shift();
            node.left && queue.push(node.left);
            node.right && queue.push(node.right);
        }
    }
    return count;
}

559. N叉树的最大深度

方法一：递归法

/**
 * // Definition for a _Node.
 * function _Node(val,children) {
 *    this.val = val;
 *    this.children = children;
 * };
 */

/**
 * @param {_Node|null} root
 * @return {number}
 */
var maxDepth = function (root) {
    if (!root) return 0;
    let depth = 0;
    for (let node of root.children) {
        depth = Math.max(depth, maxDepth(node));
    }
    return depth + 1;
}

方法二：层序遍历

/**
 * // Definition for a _Node.
 * function _Node(val,children) {
 *    this.val = val;
 *    this.children = children;
 * };
 */

/**
 * @param {_Node|null} root
 * @return {number}
 */
var maxDepth = function (root) {
    if (!root) return 0;
    let count = 0;
    let queue = [root];
    while (queue.length) {
        let size = queue.length;
        count++;
        while (size--) {
            let node = queue.shift();
            for (let item of node.children) {
                item && queue.push(item);;
            }
        }
    }
    return count;
}