题目
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?
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/binary-tree-preorder-traversal
解题思路
二叉树的前序遍历(顺序:根左右),非递归实现方式可借助stack实现;
- 循环遍历左子树,直至左儿子为空,每次遍历将当前数据压入栈中,并将该数据添加到返回vector中;
- 当左子树遍历完毕后,若当前栈不为空,则从栈里pop出一个树节点,再判断是否有右儿子;若有右儿子,则从步骤1开始循环遍历右儿子的左子树;若没有右儿子,则继续从栈中pop出数据,循环步骤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) {
vector<int> retVector;
if (!root)
return retVector;
TreeNode* curNode = root;
stack<TreeNode*> nodeStack;
while (curNode || !nodeStack.empty())
{
while (curNode)
{
retVector.push_back(curNode->val);
nodeStack.push(curNode);
curNode = curNode->left;
}
if (!nodeStack.empty())
{
curNode = nodeStack.top();
nodeStack.pop();
curNode = curNode->right;
}
}
return retVector;
}
}