题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
思路:
方法一:递归(DFS)
方法二:层序遍历
代码
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
//方法一:递归(DFS)
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if(pRoot == NULL) return 0;
int L = TreeDepth(pRoot->left);
int R = TreeDepth(pRoot->right);
return max(L,R)+1;
}
};
/*
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*> que;
que.push(pRoot);
int depth = 0;
while(!que.empty())
{
int size = que.size();//当前队列里的结点数
depth++;//深度+1
for(int i = 0 ;i<size;i++)//每一层的每个结点分别入队列
{
TreeNode* node = que.front();
que.pop();
if(node->left) que.push(node->left);
if(node->right) que.push(node->right);
}
}
return depth;
}
};