1.给出一棵二叉树,返回其中序遍历
2.前序遍历复制过来
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: Inorder in vector which contains node values.
*/
public:
std::vector<int> binary;
vector<int> inorderTraversal(TreeNode *root) {
// write your code here
if(root==NULL)return binary;
else
{
inorderTraversal(root->left);
binary.push_back(root->val);
inorderTraversal(root->right);
return binary;
}
}
};
4.感想
这个题和前序遍历差不多吧,应该是.....反正就是递归..