给定一个二叉树,返回它的中序 遍历。
必看:【经典面试题二】二叉树的递归与非递归遍历(前序、中序、后序)
/**
* 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> a;
vector<int> inorderTraversal(TreeNode* root) {
if(root==NULL)
return a;
else
printT(root);
return a;
}
void printT(TreeNode* root){
if(root->left!=NULL)
printT(root->left);
a.push_back(root->val);
if(root->right!=NULL)
printT(root->right);
}
};