LeetCode 104.二叉树的最大深度

题目描述

给定一个二叉树，找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。

解题思路DFS

• 递归：根据二叉树的特点，可以知道一个二叉树的深度取决于左右子树
  

Cpp实现

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (root == NULL)
        return 0;
        return max(maxDepth(root->left),maxDepth(root->right)) + 1;
        
    }
};

• 时间复杂度：O(n)

Python实现

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        if root is None:
            return 0
        return max(self.maxDepth(root.left),self.maxDepth(root.right)) + 1

• 时间复杂度：O(n)

解题思路

• 迭代：首先将a压入栈，a出栈，将c、b压入栈(栈是先入后出的特点，所以从右向左压入)，b出栈，将e、d入栈，d、e、c出栈，将g、f压入栈，f、g出栈。
  

Python实现

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def maxDepth(self, root: TreeNode) -> int:
        stack = []
        if root is not None:
            stack.append((1,root))
        depth = 0
        while stack != []:
            cur_depth,root = stack.pop()
            if root is not None:
                depth = max(depth,cur_depth)
                stack.append((cur_depth + 1,root.left))
                stack.append((cur_depth + 1,root.right))
        return depth

• 时间复杂度：O(n)

解题思路BFS

Cpp实现

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root == NULL) return 0;
        queue<TreeNode*> q;
        q.push(root);
        int depth = 0;
        while(q.empty() == false){
            depth++;
            int size = q.size();
            for(int i = 0;i < size;i++){
                TreeNode *p = q.front();
                q.pop();
                if(p->left) q.push(p->left);
                if(p->right) q.push(p->right);
            }
        }
        return depth;
    }
};

Java实现

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        LinkedList<TreeNode> queue = new LinkedList<>();
        int depth = 0;
        queue.add(root);
        while(!queue.isEmpty()){
            depth++;
            int size = queue.size();
            for(int i = 0;i < size;i++){
                TreeNode p = queue.pollFirst();
                if(p.left != null) queue.add(p.left);
                if(p.right != null) queue.add(p.right);
            }
        }
        return depth;
    }
}

• 时间复杂度：O(n)