226. 翻转二叉树
翻转一棵二叉树。
示例:
输入:
4 / \ 2 7 / \ / \ 1 3 6 9 输出: 4 / \ 7 2 / \ / \ 9 6 3 1
利用层次遍历交换左右结点
public TreeNode invertTree(TreeNode root) {
if(root == null)
return root;
Queue<TreeNode>queue = new LinkedList<TreeNode>();
queue.offer(root);
while(!queue.isEmpty()){
TreeNode node = queue.poll();
TreeNode rnode = node.right;
node.right = node.left;
node.left = rnode;
if(node.left != null)
queue.offer(node.left);
if(node.right !=null)
queue.offer(node.right);
}
return root;
}
递归
public TreeNode invertTree(TreeNode root) {
if(root == null)
return root;
TreeNode lroot = invertTree(root.left);
TreeNode rroot = invertTree(root.right);
root.left = rroot;
root.right = lroot;
return root;
}