int TreeSize(struct TreeNode* root)
{
return root == NULL ? 0 :TreeSize(root->left) + TreeSize(root->right) +1;
}
void preorder(struct TreeNode* root,int* a,int* pi)
{
if(root == NULL)
return ;
a[(*pi++)] = root->val;
preorder(root->left, a, pi);
preorder(root->right, a, pi);
}
int* preorderTraversal(struct TreeNode* root, int* returnSize)
{
*returnSize = TreeSize(root);
int* a = (int*)malloc(*returnSize * sizeof(int));
int i = 0;
preorder(root, a, &i);
return a;
}
bool _isSymmetric(struct TreeNode* root1,struct TreeNode* root2)
{
if(root1 == NULL && root2 == NULL)
return true;
if(root1 == NULL || root2 == NULL)
return false;
if(root1->val != root2->val)
return false;
return _isSymmetric(root1->left,root2->right)
&& _isSymmetric(root1->right,root2->left);
}
bool isSymmetric(struct TreeNode* root)
{
return !root || _isSymmetric( root->left, root->right);
}