树的结构如下所示:
我们使用深度优先搜索对其进行遍历:
class Node: def __init__(self, id, anime): self.id = id self.anime = anime self.left = None # <Left node> self.right = None # <Right node> def DFS_iterative(node): # Set up a list called nodes_list with `node` being the first and only entry. nodes_list=[node] while True: # If there are no entries in nodes_list, break. if len(nodes_list) == 0: break # node = last node in nodes_list. node = nodes_list[-1] # Remove the last node in nodes_list using slicing or list.pop(). nodes_list.pop() # Prin