题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
思路
递归。
或迭代。
代码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 == nullptr) return 0;
int left = TreeDepth(pRoot->left);
int right = TreeDepth(pRoot->right);
return max(left, right) + 1;
}
};
代码2
class Solution {
public:
int TreeDepth(TreeNode* pRoot){
if (pRoot == nullptr) return 0;
stack<pair<TreeNode*, int>> s;
s.emplace(make_pair(pRoot, 1));
int maxDepth = 0, curDepth = 0;
while (!s.empty()){
while (pRoot){
s.emplace(make_pair(pRoot, ++curDepth));
maxDepth = max(maxDepth, curDepth);
pRoot = pRoot->left;
}
curDepth = s.top().second;
auto cur = s.top().first;
s.pop();
if (cur->right) pRoot = cur->right;
}
return maxDepth;
}
};