最初思路:
1.求树的中序遍历,存入vector;
2.判断vector是否为为镜像;
/**
* 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> v;
void get(int a){
v.push_back(a);
}
void LDR(TreeNode *root){
if (root==NULL)
return;
else{
LDR(root->left);
get(root->val);
LDR(root->right);
}
return;
}
bool reverse(vector<int> n,int start,int end,int length){
if (length==0||length==1)
return true;
if (n.at(start)!=n.at(end))
return false;
else{
return reverse(n,start+1,end-1,length-2);
}
}
bool isSymmetric(TreeNode* roo