2020-05-13
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> myvector;
stack<TreeNode*> mystack;
TreeNode* p=root;
while(p||!mystack.empty()){
while(p){
myvector.push_back(p->val);
mystack.push(p);
p=p->left;
}
if (!mystack.empty()){
p=mystack.top();
mystack.pop();
p=p->right;
}
}
return myvector;
}
};