树大都用了递归的思想,这到题也是;
一颗只有根节点和叶子的二叉树,转置它是左右子树交换;
左右子树转置又是这样,这样就是自己调用自己了;
然后还要有递归的出口,当没有儿子的时候或者根节点为空时,返回自己,这个就是出口;
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode* invertTree(struct TreeNode* root) {
struct TreeNode *t;
if(root == NULL||root->left == NULL&&root->right == NULL)
{
return root;
}
else
{
t = root->right;
root->right = root->left;
root->left = t;
invertTree(root->left);
invertTree(root->right);
return root;
}
}