Invert Binary Tree

最新推荐文章于 2024-01-28 21:29:53 发布

原创最新推荐文章于 2024-01-28 21:29:53 发布 · 305 阅读

0 ·

CC 4.0 BY-SA版权

leetCode 专栏收录该内容

199 篇文章

订阅专栏

本文提供了一种翻转二叉树的算法实现，通过递归方式交换每个节点的左右子树来完成整个二叉树的翻转。该算法简单高效，易于理解和实现。

题目链接
Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so fuck off.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode invertTree(TreeNode root) {
         if(root!=null)
        {

        TreeNode A=root.left;
        root.left=root.right;
        root.right=A;
        invertTree(root.left);
        invertTree(root.right);
        }
        return root;
    }
}