leetcode 剑指 Offer 55 - I. 二叉树的深度 / 104. 二叉树的最大深度

剑指 Offer 55 - I. 二叉树的深度 / 104. 二叉树的最大深度

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof
著作权归领扣网络所有。

输入一棵二叉树的根节点，求该树的深度。从根节点到叶节点依次经过的节点（含根、叶节点）形成树的一条路径，最长路径的长度为树的深度。

例如：
给定二叉树 [3,9,20,null,null,15,7]，

返回它的最大深度 3 。

提示：

节点总数 <= 10000

DFS 写法1-有返回值:

执行用时: 12 ms
内存消耗: 7.7 MB

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */


int maxDepth(struct TreeNode* root){
    if (root == NULL) {
        return 0;
    }
    int left = maxDepth(root->left)+1;
    int right =  maxDepth(root->right)+1;

    return  left > right ? left : right;
}


int maxDepth(struct TreeNode* root){
    if (root == NULL ) return 0;
    return fmax(maxDepth(root->left), maxDepth(root->right)) +1;
}

DFS 写法2-无返回值:

执行用时: 8 ms
内存消耗: 7.8 MB

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

void getDepth(struct TreeNode* root, int level, int *depth) {
    if (root) {
        level++;
        *depth = level > *depth ? level : *depth;
        getDepth(root->left, level, depth);
        getDepth(root->right, level, depth);
    }
}

int maxDepth(struct TreeNode* root){
    int depth = 0;
    getDepth(root, 0, &depth);

    return depth;
}

BFS 写法-一维数组：

执行用时: 4 ms
内存消耗: 11.5 MB

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

#define N 10000
int maxDepth(struct TreeNode* root){
    if (root == NULL) {
        return 0;
    }

    struct TreeNode **queue = calloc(sizeof(struct TreeNode *), N), *node = NULL;
    int left = 0, right = 0, size = 0, level = 0;
    queue[right++] = root;
   
    while (left < right ) {
        size = right - left;
        while (size--) {
            node = queue[left++];
            if ( node->left )  queue[right++] = node->left;
            if ( node->right ) queue[right++] = node->right;
        }
        level++;
    }
    
    return level;
}

BFS 写法-一维数组-PHP数组：

执行用时: 20 ms
内存消耗: 16.9 MB

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     public $val = null;
 *     public $left = null;
 *     public $right = null;
 *     function __construct($value) { $this->val = $value; }
 * }
 */
class Solution {
    private $queue = [];
    /**
     * @param TreeNode $root
     * @return Integer
     */
    function maxDepth($root) {
        if ($root == null) {
            return 0;
        }
        $level = 0;
        array_push($this->queue, $root);
        while ( ! empty($this->queue) ) {
            $size = count($this->queue);
            while ($size--) {
                $node = array_shift($this->queue);
                $node->left && array_push($this->queue, $node->left);
                $node->right && array_push($this->queue, $node->right);
            }
            $level++;
        }

        return $level;
    }
}