Leetcode 104. Maximum Depth of Binary Tree

104. Maximum Depth of Binary Tree

难度：easy
问题描述：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.
找到树的最大层数

解法1

思路：递归，利用深度优先遍历的思想

/**
 * 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) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
           if(!root) return 0;
           return 1+max(maxDepth(root->left),maxDepth(root->right));
      }
};

解法2

思路：遍历，挨个遍历每一层

/**
 * 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) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
           if(!root) return 0;
           if(!root->left&&!root->right) return 1;
           queue<TreeNode*> q;
           q.push(root);
           int depth = 0;
           while(!q.empty())
           {
               depth++;
               for(int i=q.size();i>0;--i)
               {
                   TreeNode* node = q.front();
                   q.pop();
                   if(node->left) q.push(node->left);
                   if(node->right) q.push(node->right);
               }
           }
           return depth;
      }
};