【剑指Offer】二叉树的深度

题目描述

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

第一种：

非递归 层次遍历

/*
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==NULL)
            return 0;
        queue<TreeNode*> q;
        q.push(pRoot);
        int depth=0,count=0,nextcount=1;
//nextcount代表本层的个数，count表示到达本层最后一个结点                                                  
        while(!q.empty()){
            TreeNode* node = q.front();
            count++;
            q.pop();
            if(node->left)
                q.push(node->left);
            if(node->right)
                q.push(node->right);
            if(count==nextcount){
                nextcount=q.size();
                count=0;
                depth++;
            }
        }
        return depth;
    }
};

第二种：

递归

/*
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==NULL)
            return 0;
        int left = TreeDepth(pRoot->left);
        int right = TreeDepth(pRoot->right);
        return left > right ? left+1 :right+1;
    }
};