题目描述
给定一个二叉树,返回它的前序遍历。
思路
代码
递归法
#class TreeNode:
# def __init__(self,x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def preorderTraversal(self,root:TreeNode) -> List[int]:
res = []
def helper(root):
if not root:
return
res.append(root.val)
helper(root.left)
helper(root.right)
helper(root)
return res
迭代法
#class TreeNode:
# def __init__(self,x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def preorderTraversal(self,root:TreeNode) -> List[int]:
res = []
if not root:
return res
stack = [root]
while stack:
node = stack.pop()
res.append(node.val)
if node.right:
stack.append(node.right) #满足栈的后进先出原则
if node.left:
stack.append(node.left)
return res
颜色标记法
class TreeNode:
def __init__(self,x):
self.val = x
self.left = None
self.right = None
class Solution:
def preorderTraversal(self,root:TreeNode):
res = []
WHITE , GRAY = 0 , 1
stack = [(WHITE,root)]
while stack:
color , node = stack.pop()
if node:
if color == WHITE:
stack.append((WHITE,node.right))
stack.append((WHITE,node.left))
stack.append((GRAY,node))
else:
res.append(node.val)
return res
def stringToTreeNode(input):
input = input.strip()
input = input[1:-1]
if not input:
return None
inputValues = [s.strip() for s in input.split(',')]
root = TreeNode(int(inputValues[0]))
nodeQueue = [root]
front = 0
index = 1
while index < len(inputValues):
node = nodeQueue[front]
front = front + 1
item = inputValues[index]
index = index + 1
if item != "null":
leftNumber = int(item)
node.left = TreeNode(leftNumber)
nodeQueue.append(node.left)
if index >= len(inputValues):
break
item = inputValues[index]
index = index + 1
if item != "null":
rightNumber = int(item)
node.right = TreeNode(rightNumber)
nodeQueue.append(node.right)
return root
list = input("输入:")
b = stringToTreeNode(list)
test = Solution()
test.preorderTraversal(b)