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)
全部评论
相关推荐
09-17 14:33
门头沟学院 Java 
投递招商银行等公司10个岗位 点赞 评论 收藏
分享
查看9道真题和解析
