今天头条面试遇到这道题,还要求出路径。非递归虽然很直观,但是要加上一个栈保存每个节点的深度。如果要非递归保存路径的话,还得加一个栈保存路径。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
if(!root) return 0;
stack<TreeNode*> st;
stack<int> dst;
TreeNode *t = root;
int depth = 0;
int curdepth = 0;
st.push(root);
dst.push(1);
while(!st.empty() || !t){
t = st.top(); st.pop();
curdepth = dst.top(); dst.pop();
depth = (curdepth > depth) ? curdepth : depth;
if(t->left) {
st.push(t->left);
dst.push(curdepth + 1);
}
if(t->right){
st.push(t->right);
dst.push(curdepth + 1);
}
}
return depth;
}
};