题目链接
https://leetcode.com/problems/binary-tree-preorder-traversal/
知识点:
树,递归,栈,迭代等。
思路:
1.递归进行树的前序遍历
2.借助栈来进行迭代
AC代码:
1.
递归
class Solution {
public:
vector<int> res;
vector<int> preorderTraversal(TreeNode* root) {
if(root!=NULL)
{
res.push_back(root->val);
preorderTraversal(root->left);
preorderTraversal(root->right);
}
return res;
}
};
2.
迭代
class Solution {
public:
vector<int> preorderTraversal(TreeNode *root) {
vector<int> res;
stack<TreeNode*> tempStack;
while (!tempStack.empty() || root != NULL) {
if (root != NULL) {
res.push_back(root->val);
tempStack.push(root);
root = root->left;
}
else {
root = tempStack.top();
tempStack.pop();
root = root->right;
}
}
return res;
}
};
leetcode上类似的两道题(中序、后序遍历):
改变一下指定几行代码的位置顺序即可。
94. Binary Tree Inorder Traversal
145. Binary Tree Postorder Traversal