/
maximum_depth_of_tree.cpp
57 lines (57 loc) · 1.28 KB
/
maximum_depth_of_tree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
struct StateNode {
TreeNode treeNode;
int height;
public:
StateNode():height(0), treeNode(0) {}
};
#include<stack>
class Solution {
stack<StateNode> treeStack;
public:
int maxDepth(TreeNode *root) {
// Note: The Solution object is instantiated only once and is reused by each test case.
stack<StateNode> tmp;
treeStack.swap(tmp);
int maxHeight = 0;
if (root != NULL)
{
StateNode initState;
initState.height = 1;
initState.treeNode = *root;
treeStack.push(initState);
while(!treeStack.empty())
{
StateNode sNode = treeStack.top();
if (sNode.height > maxHeight)
{
maxHeight = sNode.height;
}
treeStack.pop();
if (sNode.treeNode.left != NULL)
{
StateNode newNode;
newNode.height = sNode.height + 1;
newNode.treeNode = *sNode.treeNode.left;
treeStack.push(newNode);
}
if (sNode.treeNode.right != NULL)
{
StateNode newNode;
newNode.height = sNode.height + 1;
newNode.treeNode = *sNode.treeNode.right;
treeStack.push(newNode);
}
}
}
return maxHeight;
}
};