翻转一棵二叉树。
示例:
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
4
/ \
7 2
/ \ / \
9 6 3 1
这个题的思路就是两数交换的思路,只是需要遍历每一个节点,然后把每个节点的左右两个节点都交换。既可以用递归,也可以用迭代,都是很简单的思想。和之前一样用c++写递归,用python3写迭代,迭代还是使用队列来进行遍历(层次遍历)。
C++源代码:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* invertTree(TreeNode* root) {
if (root==NULL)
return NULL;
TreeNode *tmp = root->left;
root->left = invertTree(root->right);
root->right = invertTree(tmp);
return root;
}
};
python3源代码:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def invertTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
if root==None:
return None
q = [root]
while len(q):
now = q.pop(0)
tmp = now.left
now.left = now.right
now.right = tmp
if now.left!=None:
q.append(now.left)
if now.right!=None:
q.append(now.right)
return root