给出一棵二叉树 {1,#,2,3}
,
1 \ 2 / 3
2:解题思路:用递归的方法前序遍历二叉树,存到vector里去,返回数组,得到二叉树的内容。
3:解题代码:
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
/**
* @param root: The root of binary tree.
* @return: reorder in vector which contains node values.
*/
public:
std::vector<int> binary;
vector<int> preorderTraversa(TreeNode *root) {
// write your code here
if(root==NULL)return binary;
else
{
binary.push_back(root->val);
preorderTraversa(root->left);
preorderTraversa(root->right);
return binary;
}
}
};