《LeetCode力扣练习》代码随想录——二叉树(翻转二叉树—Java)
刷题思路来源于 代码随想录
226. 翻转二叉树
-
二叉树
/** * 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; } recursion(root); return root; } private void recursion(TreeNode root) { if (root == null) { return; } swap(root); recursion(root.left); recursion(root.right); } private void swap(TreeNode root) { TreeNode temp = root.left; root.left = root.right; root.right = temp; } }