Practice28：输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度

Practice28:

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if(!pRoot)return 0;
        queue<TreeNode*> pq;
        pq.push(pRoot);
        int level=0;
        while(!pq.empty()){
            int size = pq.size();
            while(size--){
                TreeNode* mid = pq.front();
                pq.pop();
                if(mid->left)pq.push(mid->left);
                if(mid->right)pq.push(mid->right);
            }
            ++level;
        }
        return level;
    }
};

输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

S1

分而治之法

/*
struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) :
			val(x), left(NULL), right(NULL) {
	}
};*/
class Solution {
public:
    int TreeDepth(TreeNode* pRoot)
    {
        if(!pRoot)return 0;
        int lval = TreeDepth(pRoot->left);
        int rval = TreeDepth(pRoot->right);
        return max(lval,rval)+1;
    }
};

S2

队列遍历法