题目来源:
https://leetcode.com/problems/binary-tree-preorder-traversal/
https://leetcode.com/problems/binary-tree-inorder-traversal/
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> ret;
if(root == NULL) return ret;
stack<TreeNode *> s;
while(root || !s.empty())
{
while(root)
{
s.push(root);
root = root->left;
}
root = s.top();
s.pop();
ret.push_back(root->val);
root = root->right;
}
return ret;
}
vector<int> preorderTraversal(TreeNode* root) {
vector<int> ret;
if(root == NULL) return ret;
stack<TreeNode *> s;
while(root || !s.empty())
{
while(root)
{
s.push(root);
ret.push_back(root->val);
root = root->left;
}
root = s.top();
s.pop();
root = root->right;
}
return ret;
}
};