题目:给定一个二叉树,原地将它展开为一个单链表。
思路:
- 先序遍历存起来,然后生成链表
- 递归:从下往上,先将左右子树分别展开,如果左子树存在,找到左子树最右节点,将根节点右子树接到该节点之后,同时转换左子树为右子树,左子树设空
- 非递归:从上往下,先找到左子树最右节点,与递归思路类似,转换后,根节点下移,直至为空
代码:
- 递归
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def flatten(self, root):
"""
:type root: TreeNode
:rtype: None Do not return anything, modify root in-place instead.
"""
if not root:return
self.flatten(root.left)
self.flatten(root.right)
if root.left:
pre = root.left
while pre.right:
pre = pre.right
pre.right = root.right
root.right = root.left
root.left = None
return root
- 非递归
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def flatten(self, root):
"""
:type root: TreeNode
:rtype: None Do not return anything, modify root in-place instead.
"""
while root:
if root.left:
pre = root.left
while pre.right:
pre = pre.right
pre.right = root.right
root.right = root.left
root.left = None
root = root.right
return root