leetcode 144. Binary Tree Preorder Traversal #Medium
题意:给定一个二叉树,输出二叉树的前序遍历序列。
分析:比较基础的题目,递归写法非常简单,但是效率不高。前序遍历迭代实现代码:
/**
* 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
inorderTraversal(TreeNode* root) {
vector
r;
stack
s;
for(auto p=root;p || !s.empty();){
for(;p;p=p->left)s.push(p);
p=s.top();
r.push_back(p->val);
s.pop();
p=p->right;
}
return r;
}
};