1 题目描述
Invert a binary tree.
4 / \ 2 7 / \ / \ 1 3 6 9to
4 / \ 7 2 / \ / \ 9 6 3 1题目出处: https://leetcode.com/problems/invert-binary-tree/
2 解题思路
这个题目是对二叉树遍历算法的变形,在遍历过程中对每个节点的左右儿子进行交换。
3 源代码
package com.larry.easy;
import com.larry.util.TreeNode;
public class InvertBinaryTree {
public void inOrder(TreeNode root){
if(root == null) return;
TreeNode tempNode = root.left;
root.left = root.right;
root.right = tempNode;
inOrder(root.left);
inOrder(root.right);
}
public TreeNode invertTree(TreeNode root) {
inOrder(root);
return root;
}
}