Leetcode 226.翻转二叉树 Java
给你一棵二叉树的根节点 root ,翻转这棵二叉树,并返回其根节点。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/invert-binary-tree/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
翻转二叉树,前后序都可以
/**
* 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;
changechild(root); //前后序都行
invertTree(root.left);
invertTree(root.right);
return root;
}
private void changechild(TreeNode k) //交换左右节点
{
TreeNode temp;
temp=k.left;
k.left=k.right;
k.right = temp;
}
}