226. Invert Binary Tree（C语言）

226. Invert Binary Tree（C语言）

左右倒转二叉树

题目

Given the root of a binary tree, invert the tree, and return its root.

Example 1:

Input: root = [4,2,7,1,3,6,9]
Output: [4,7,2,9,6,3,1]
Example 2:

Input: root = [2,1,3]
Output: [2,3,1]
Example 3:
Input: root = []
Output: []

Constraints:
The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100

解答

递归

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* temp;
void Tra(struct TreeNode* root)
{
    if(root == NULL)
        return ;
    
    temp = root->left;
    root->left = root->right;
    root->right = temp;

    Tra(root->left);
    Tra(root->right);
}
struct TreeNode* invertTree(struct TreeNode* root){
    temp = (struct TreeNode*)malloc(sizeof(struct TreeNode));
    Tra(root);
    return root;
}

总结

要左右倒转整个二叉树，就是从上到下来左右倒转每一个子树。