LeetCode/InvertBinaryTree.java at master · Orio77/LeetCode · GitHub

31 lines (26 loc) · 678 Bytes

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;

if (root.left == null && root.right == null)

return root;

TreeNode swapper = root.left;

root.left = root.right;

root.right = swapper;

invertTree(root.left);

invertTree(root.right);

return root;

}

Expand file tree