原题链接:http://www.lintcode.com/zh-cn/problem/invert-binary-tree/
翻转一棵二叉树
样例
1 1
/ \ / \
2 3 => 3 2
/ \
4 4
挑战
递归固然可行,能否写个非递归的?
分析:
递归并没有难度,用后序遍历,用栈的形式存放结点。
时间复杂度 O(n)
代码(C++、Python、Java):
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param root: a TreeNode, the root of the binary tree
* @return: nothing
*/
void invertBinaryTree(TreeNode *root) { //LRD
// write your code here
TreeNode *x = root;
vector<TreeNode *> s;
while(x != NULL || s.size() != 0){
while(x != NULL){
s.push_back(x);
x = x->left;
}
TreeNode *y = s.back();
s.pop_back();
TreeNode *tmp;
tmp = y->left;
y->left = y->right;
y->right = tmp;
x = y->left;
}
}
};
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
# @param root: a TreeNode, the root of the binary tree
# @return: nothing
def invertBinaryTree(self, root):
# write your code here
x = root
a = [x for i in range(1000)]
siz = 0
while x is not None or siz != 0:
while x is not None:
siz += 1
a[siz] = x
x = x.left
if siz == 0:
break
y = a[siz]
siz -= 1
(y.left, y.right) = (y.right, y.left)
x = y.left
/**
* Definition of TreeNode:
* public class TreeNode {
* public int val;
* public TreeNode left, right;
* public TreeNode(int val) {
* this.val = val;
* this.left = this.right = null;
* }
* }
*/
public class Solution {
/**
* @param root: a TreeNode, the root of the binary tree
* @return: nothing
*/
public void invertBinaryTree(TreeNode root) {
// write your code here
TreeNode x = root;
Vector <TreeNode > s = new Vector<TreeNode>();
while(x != null || s.size() != 0){
while(x != null){
s.addElement(x);
x = x.left;
}
TreeNode y = s.get(s.size()-1);
s.remove(s.size()-1);
TreeNode tmp;
tmp = y.left;
y.left = y.right;
y.right = tmp;
x = y.left;
}
}
}