Maximum Depth of Binary Tree

问题描述：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.

思路:如何求二叉树的最大深度，最朴素的想法就是一层一层遍历，每增加一层就把结果加一，最后返回这个结果就可以了，这就是广度优先，当然更简单的方法就是用深度优先，也就是说用递归返回左节点和有右节点中的较大值，终止条件是当指针等于NULL，这两种方法我们分别来实现一次。

代码：

1. depth first

//we solve this problem with depth first way
#include<iostream>
#include<queue>
using namespace std;

struct TreeNode{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x): val(x),left(NULL),right(NULL){}
};

int maxDepth(TreeNode *root){
    return root == NULL ? 0 : max(maxDepth(root->left),maxDepth(root->right))+1;
}

int main(){
    TreeNode *root = new TreeNode(1);
    root->left = new TreeNode(2);
    root->right = new TreeNode(3);
    root->left->left = new TreeNode(4);
    cout<<maxDepth(root)<<endl;
}

1. breadth first

#include<iostream>
#include<queue>
using namespace std;

struct TreeNode{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x): val(x),left(NULL),right(NULL){}
};

int maxDepth(TreeNode *root)
{
    if(root == NULL)
        return 0;

    int res = 0;
    queue<TreeNode *> q;
    q.push(root);
    while(!q.empty())
    {
        ++ res;
        for(int i = 0, n = q.size(); i < n; ++ i)
        {
            TreeNode *p = q.front();
            q.pop();

            if(p -> left != NULL)
                q.push(p -> left);
            if(p -> right != NULL)
                q.push(p -> right);
        }
    }

    return res;
}

int main(){
    TreeNode *root = new TreeNode(1);
    root->left = new TreeNode(2);
    root->right = new TreeNode(3);
    root->left->left = new TreeNode(4);
    cout<<maxDepth(root)<<endl;
}

复杂度：深度优先的算法复杂度是$O(log(n))$，广度优先的算法复杂度是$O(n)$