1 题目
Given a binary tree, return the preorder traversal of its nodes' values.
Example:
Input: [1,null,2,3]
1
\
2
/
3
Output: [1,2,3]
Follow up: Recursive solution is trivial, could you do it iteratively?
2 尝试解
/**
* 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) {
stack<TreeNode*> saver;
vector<int> result;
if(root == NULL) return result;
saver.push(root);
while(!saver.empty()){
TreeNode* temp = saver.top();
saver.pop();
result.push_back(temp->val);
if(temp->right != NULL) saver.push(temp->right);
if(temp->left != NULL) saver.push(temp->left);
}
return result;
}
};
3 标准解
class Solution {
public:
vector<int> preorderTraversal(TreeNode *root) {
if (root==NULL) {
return vector<int>();
}
vector<int> result;
stack<TreeNode *> treeStack;
treeStack.push(root);
while (!treeStack.empty()) {
TreeNode *temp = treeStack.top();
result.push_back(temp->val);
treeStack.pop();
if (temp->right!=NULL) {
treeStack.push(temp->right);
}
if (temp->left!=NULL) {
treeStack.push(temp->left);
}
}
return result;
}
};