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]
.
给定一个二叉树,返回其前序遍历节点值。
学过数据结构应该就很简单,代码如下:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
vector<int> result;
void preorder(TreeNode *root)
{
if(root==NULL) return;
result.push_back(root->val);
preorderTraversal(root->left);
preorderTraversal(root->right);
}
public:
vector<int> preorderTraversal(TreeNode *root) {
preorder(root);
return result;
}
};