2020-09-07 15:15 广东外语外贸大学 Java
关注
def lrm_f(self,root):
stack=[]
result_stack=[]
if root is not None:
stack.append(root)
while len(stack)!=0:
root=stack.pop()
result_stack.append(root)
if root.left is not None:
stack.append(root.left)
if root.right is not None:
stack.append(root.right)
while len(result_stack)!=0:
result3.append(result_stack.pop().val)
stack=[]
result_stack=[]
if root is not None:
stack.append(root)
while len(stack)!=0:
root=stack.pop()
result_stack.append(root)
if root.left is not None:
stack.append(root.left)
if root.right is not None:
stack.append(root.right)
while len(result_stack)!=0:
result3.append(result_stack.pop().val)
全部评论
相关推荐
06-27 15:30
南京大学 自动化 
点赞 评论 收藏
分享
