LintCode 翻转二叉树

最新推荐文章于 2017-10-31 15:31:16 发布

子夜恒

最新推荐文章于 2017-10-31 15:31:16 发布

阅读量270

点赞数

分类专栏： LintCode 文章标签：树的翻转 LintCode

本文链接：https://blog.csdn.net/u012762106/article/details/47809327

版权

LintCode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

样例

  1         1
 / \       / \
2   3  => 3   2
   /       \
  4         4

挑战

递归固然可行，能否写个非递归的？

public void invertBinaryTree(TreeNode root) {
		// write your code here
		if (root == null)
			return;
		Queue<TreeNode> queue = new ArrayDeque<TreeNode>();
		queue.offer(root);
		while (!queue.isEmpty()) {
			TreeNode node = queue.poll();
			if (node.left != null)
				queue.offer(node.left);
			if (node.right != null)
				queue.offer(node.right);
			TreeNode temp = new TreeNode(0);
			temp = node.left;
			node.left = node.right;
			node.right = temp;
		}
	}



class TreeNode {
	public int val;
	public TreeNode left, right;

	public TreeNode(int val) {
		this.val = val;
		this.left = this.right = null;
	}
}