Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree [1,null,2,3]
,
1 \ 2 / 3
return [1,2,3]
.
Note: Recursive solution is trivial, could you do it iteratively?
思路:先序遍历
我们来看树A,首先从根节点5开始,先根输出5,然后左子树2,此时的位置在2,2相当于1和4两个结点的根,所以遍历2之后,先遍历2的左子树1,1没有子结点,所以遍历2的右子树4,4有左子树遍历3,这样完成了节点5的左子树遍历,再遍历5的右子树6,先遍历6的左子树,这里没有,就遍历6的右子树8,然后再遍历8的左右子树,左子树7,当然7没有孩子结点,所以接下来是9,然后 11 10类似。
代码1:
/**
* 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> result;
if(!root) {return result;}
stack<TreeNode*> s;
s.push(root);
while(!s.empty()){
TreeNode* node;
node = s.top();
result.push_back(node->val);
s.pop();
if(node->right){s.push(node->right);}
if(node->left){s.push(node->left);}
}
return result;
}
};
代码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> res;
vector<int> preorderTraversal(TreeNode* root) {
if(!root){return res;}
res.push_back(root->val);
if(root->left){res=preorderTraversal(root->left);}
if(root->right){res=preorderTraversal(root->right);}
return res;
}
};