leetcode144题。
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3}
,
1 \ 2 / 3
return [1,2,3]
.
Note: Recursive solution is trivial, could you do it iteratively?
用递归的话先序遍历很简单,但是用迭代的方法的话就得使用c++的stack容器了
/**
* 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> treenodeValue;
stack<TreeNode *> sTreeNode;
if (root != NULL)
{
sTreeNode.push(root);
while (!sTreeNode.empty())
{
TreeNode * temp = sTreeNode.top();
treenodeValue.push_back(temp->val);
sTreeNode.pop();
if (temp->right)
sTreeNode.push(temp->right);
if (temp->left)
sTreeNode.push(temp->left);
}
}
return treenodeValue;
}
};
先把右子树入栈,再左子树入栈,这样弹栈的时候先弹的是左子树,达到先序的目的。
发现c++标准库的容器真大爷的好用,,越来越依赖了啊,,,现在好多题都不用c来写了,,都用c++了。。。是不是不是太好呢。。