104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its depth = 3.

思路：广度优先

代码1：

/**
 * 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) {
        int layer=0,layerl=0,layerr=0;
        TreeNode* p=root;
        if(root==NULL){return 0;}
        if(p->left==NULL && p->right==NULL){
            layer = 1;
            return layer;
        }
        else{
            layerl=1+maxDepth(p->left);
            layerr=1+maxDepth(p->right);
        }
        return layerl>layerr? layerl:layerr;
    }
};

代码2：

/**
 * 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*> sp;
        int res=0;
        sp.push(root);
        while(!sp.empty()){
            int len=sp.size();
            res++;
            while(len){
                len--;
                TreeNode* temp;
                temp=sp.front();
                sp.pop();
                if(temp->left!=NULL){sp.push(temp->left);}
                if(temp->right!=NULL){sp.push(temp->right);}
            }
        }
        return res;
    }
};

代码3：

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if (!root) return 0;
        return max(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
};