LeetCode-104. Maximum Depth of Binary Tree [C++][Java]

LeetCode-104. Maximum Depth of Binary TreeLevel up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.https://leetcode.com/problems/maximum-depth-of-binary-tree/

题目描述

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: 3

Example 2:

Input: root = [1,null,2]
Output: 2

Constraints:

• The number of nodes in the tree is in the range [0, 104].
• -100 <= Node.val <= 100

解题思路

 【C++解法】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

 1、递归大法

class Solution {
public:
    int maxDepth(TreeNode* pRoot) {
        return pRoot ? 1+max(getDepth(pRoot->left),getDepth(pRoot->right)) : 0;
    }
};

 单独分离DFS：

class Solution {
public:
    int maxDepth(TreeNode* root) {
        int maxDepth = 0;
        dfs(root, 0, maxDepth);
        return maxDepth;
    }

    void dfs(TreeNode* root, int depth, int& maxDepth) {
        if(!root ) return;
        depth += 1;
        if(depth > maxDepth) maxDepth = depth;
        dfs(root->left, depth, maxDepth);
        dfs(root->right, depth, maxDepth);
    }
};

2、BFS循环大法

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(!root) return 0;
        queue<TreeNode*> q;
        q.push(root);
        int level=0;
        while(!q.empty()){
            int len = q.size();
            level++;
            while(len--){
                TreeNode* tem = q.front(); q.pop();
                if(tem->left) q.push(tem->left);
                if(tem->right) q.push(tem->right);
            }
        }
        return level;
    }
};

【Java解法】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */

1、DFS递归

class Solution {
    public int maxDepth(TreeNode root) {
        return root != null
            ? Math.max(maxDepth(root.left), maxDepth(root.right)) + 1 : 0;
    }
}

单独分离DFS：

class Solution {
    public int maxDepth(TreeNode root) {
        return dfs(root);
    }
    
    private int dfs(TreeNode root) {
        if (root == null) {return 0;}
        return Math.max(dfs(root.left), dfs(root.right)) + 1;
    }
}

2、BFS循环

import java.util.Queue;
class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) {return 0;}
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        int level = 0;
        while (!q.isEmpty()) {
            int len = q.size();
            level++;
            while (len-- > 0) {
                TreeNode p = q.poll();
                if (p.left != null) {q.offer(p.left);}
                if (p.right != null) {q.offer(p.right);}
            }
        }
        return level;
    }
}

参考文献

【1】Java 实例 – 队列（Queue）用法 | 菜鸟教程