104/111 Maximum/Minimum Depth of Binary Tree（二叉树求深度）

104 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.

求二叉树的最大深度问题用到深度优先搜索DFS，递归的完美应用，跟求二叉树的最小深度问题原理相同。
递归方法：

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

非递归方法：

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(NULL == root) return 0;
        int res = 0;
        queue<TreeNode*> q;
        q.push(root);

        while(!q.empty()) {
            ++res;
            int n = q.size();                   //逐层遍历二叉树
            for(int i = 0; i < n; ++i) {
                TreeNode* t = q.front(); q.pop();
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
            }
        }
        return res;
    }

};

111 Given a binary tree, find its minimum depth.
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

递归方法：

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == NULL) return 0;
        if(root->left == NULL)
            return minDepth(root->right)+1;
        if(root->right == NULL)
            return minDepth(root->left)+1;
        return min(minDepth(root->left), minDepth(root->right))+1;
    }
};

非递归方法：

class Solution {
public:
    int minDepth(TreeNode* root) {
        if(root == NULL) return 0;
        queue<TreeNode*> q;
        q.push(root);
        int cur = 0;      //记录当前节点在该层的顺序编号
        int last = 1;     //记录每一层拥有节点的个数，根节点只有一个，所以初始化为1
        int level = 1;    
        while(!q.empty()) {
            TreeNode* tmp = q.front(); q.pop();
            if(tmp->left == NULL && tmp->right == NULL) {
                return level;
            }
            --last;
            if(tmp->left) {
                q.push(tmp->left);
                ++cur;
            }
            if(tmp->right) {
                q.push(tmp->right);
                ++cur;
            }
            if(last == 0) {
                last = cur;
                cur = 0;
                ++level;
            }
        }
    }
};