1.思路
递归是用二叉树的中序遍历
中序:
void fun ( T)
{
fun(T->left);
T->val;
fun(T->right);
}
前序
void fun ( T)
{T->val;
fun(T->left);
fun(T->right);
}
后序
void fun ( T)
{
fun(T->left);
fun(T->right);
T->val;
}
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> inorderTraversal(TreeNode* root) {
if(root)
{
inorderTraversal(root->left);
res.push_back(root->val);
inorderTraversal(root->right);
}
return res;
}
};
3.注意:
res 的定义要放在递归函数外面