Keyword:stack
前序:
/**
* 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> preorderTraversal(TreeNode* root) {
vector<int> result;
stack<TreeNode*> stree;
TreeNode* p = NULL;
if (root != NULL)
{
stree.push(root);
while (!stree.empty())
{
p = stree.top();
result.push_back(p->val);
stree.pop();
if (p->right != NULL)
stree.push(p->right);
if (p->left != NULL)
stree.push(p->left);
}
}
return result;
}
};
中序:
/**
* 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> result;
stack<TreeNode*> stree;
TreeNode* p = root;
do
{
while (p != NULL)
{
stree.push(p);
p = p->left;
}
if (!stree.empty())
{
p = stree.top();
stree.pop();
result.push_back(p->val);
p = p->right;
}
}while (!stree.empty() || p != NULL);
return result;
}
};