Leetcode226. 翻转二叉树(C语言)
数据结构-树:算法与数据结构参考
题目:
翻转一棵二叉树。例:
输入:[4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
思路:
递归
代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
struct TreeNode* invertTree(struct TreeNode* root){
if(!root) return NULL;
struct TreeNode* ltree=invertTree(root->right);
struct TreeNode* rtree=invertTree(root->left); // 左右子树函数等价条件
root->left=ltree;
root->right=rtree;
return root;
}