摘要: 树的结构如下所示: 我们使用深度优先搜索对其进行遍历: class Node: def __init__(self, id, anime): self.id = id self.anime = anime self.left = None # <Left node> self.right = Non 阅读全文
posted @ 2020-05-12 09:17 Geeksongs 阅读(1981) 评论(0) 推荐(0) 编辑

Coded by Geeksongs on Linux

All rights reserved, no one is allowed to pirate or use the document for other purposes.