力扣刷题记录 -- JAVA--41---226. 翻转二叉树

@白圭

已于 2024-02-10 17:02:32 修改

阅读量90

点赞数

分类专栏： # 力扣习题记录册__JAVA__代码随想录文章标签： leetcode java python

于 2023-08-28 21:00:20 首次发布

本文链接：https://blog.csdn.net/taiyuezyh/article/details/132548287

版权

力扣习题记录册__JAVA__代码随想录专栏收录该内容

151 篇文章 0 订阅

订阅专栏

一、题目

在这里插入图片描述

二、代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution
{
    //化繁为简 翻转每一个节点的左右节点 层序遍历
    public TreeNode invertTree(TreeNode root) 
    {
        if(root==null) return null;

         Queue<TreeNode> queue = new LinkedList<>();
         queue.offer(root);

         while(!queue.isEmpty())
         {
             int i;
             int length;
             length = queue.size();
             
             for(i=0;i<length;i++)
             {
                TreeNode pro = queue.poll();
                // if(pro.left!=null)  System.out.println("交换   "+"   左  "+pro.left.val );
                // if(pro.right!=null)  System.out.println("交换   "+"   右  "+pro.right.val );
                TreeNode temp;
                temp = pro.left;
                pro.left = pro.right;
                pro.right = temp;
                if(pro.left!=null) queue.offer(pro.left);
                if(pro.right!=null) queue.offer(pro.right);                
             }
         }
          

         return root;
    }
}

三、运行结果

在这里插入图片描述

四、附录

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

       Deque<TreeNode> queue1 = new LinkedList<>();
       int i;
       int length;

       queue1.addLast(root);
       while(queue1.size()!=0)
       {
           length = queue1.size();
           for(i=0;i<length;i++)
           {
               TreeNode temp = queue1.peekFirst();
               queue1.removeFirst();
               if(temp.left!=null) queue1.addLast(temp.left);
               if(temp.right!=null) queue1.addLast(temp.right);
               
                TreeNode temp_another = temp.left;
                temp.left = temp.right;
                temp.right = temp_another;
           }
       } 
       return root;
    }
}