|
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
|
/** * 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: vector<int> inorderTraversal(TreeNode* root) { vector<int> vec; inOrder(root, vec); return vec; } /* void inOrder(TreeNode *root, vector<int> &path) { //递归写法 if (root) { inOrder(root->left, path); path.push_back(root->val); inOrder(root->right, path); } } */ //非递归写法 void inOrder(TreeNode *root, vector<int> &path) { stack<TreeNode *> TreeNodeStack; while (root != NULL || !TreeNodeStack.empty()) { while(root != NULL) { TreeNodeStack.push(root); root = root->left; } if (!TreeNodeStack.empty()) { root = TreeNodeStack.top(); TreeNodeStack.pop(); path.push_back(root->val); root = root->right; } } }};
|