给定一个二叉树,返回它的 前序 遍历。
示例:
输入: [1,null,2,3]
1
2
/
3
输出: [1,2,3]
进阶: 递归算法很简单,你可以通过迭代算法完成吗?
/**
* 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*> sta;
//result.push_back(root->val);
TreeNode* node = root;
while (node != NULL || !sta.empty())
{
while (node != NULL)
{
sta.push(node);
result.push_back(node->val);
node = node->left;
}
if (!sta.empty())
{
node = sta.top();
sta.pop();
node = node->right;
}
}
return result;
}
};