226. 翻转二叉树

最新推荐文章于 2024-10-03 14:54:08 发布

小草dym

最新推荐文章于 2024-10-03 14:54:08 发布

阅读量152

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/qq_39368007/article/details/116891144

版权

数据结构与算法专栏收录该内容

40 篇文章 1 订阅

订阅专栏

这篇博客详细介绍了二叉树翻转的四种不同实现方式：前序遍历、后序遍历、中序遍历和层次遍历。每种方法都通过递归或迭代实现了树节点左右子树的交换，从而达到翻转二叉树的效果。这些算法对于理解二叉树操作和递归问题具有很好的实践价值。

摘要由CSDN通过智能技术生成

前序遍历的方式

/**
 * 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 root;

		TreeNode tmp = root.left;
		root.left = root.right;
		root.right = tmp;

		invertTree(root.left);
		invertTree(root.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 root;

       invertTree(root.left);
       invertTree(root.right);

	   TreeNode tmp = root.left;
	   root.left = root.right;
	   root.right = tmp;

       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 root;

       invertTree(root.left);

	   TreeNode tmp = root.left;
	   root.left = root.right;
	   root.right = tmp;

       invertTree(root.left);

       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 root;
		
		Queue<TreeNode> queue = new LinkedList<>();
		queue.offer(root);
		
		while (!queue.isEmpty()) {
			TreeNode node = queue.poll();
		    TreeNode tmp = node.left;
		    node.left = node.right;
		    node.right = tmp;
			
			if (node.left != null) {
				queue.offer(node.left);
			}
			
			if (node.right != null) {
				queue.offer(node.right);
			}
		}
		return root;
	}
}