Tree 如何返回顺序遍历而不只是打印它
到目前为止,我的代码只打印出一个订单traveral。不过,我希望它能退回一个Tree 如何返回顺序遍历而不只是打印它,tree,binary-tree,binary-search-tree,Tree,Binary Tree,Binary Search Tree,到目前为止,我的代码只打印出一个订单traveral。不过,我希望它能退回一个 class Node: def __init__(self, data): self.data = data self.left = None self.right = None def inorder(node): if(node==None): return else: inorder(node.left)
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def inorder(node):
if(node==None):
return
else:
inorder(node.left)
print(node.data)
inorder(node.right)
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
我知道这棵树不是二叉搜索树。你可以使用生成器
yield from
递归调用和yield
数据值
class Node:
def __init__(self, data):
self.data = data
self.left = None
self.right = None
def inorder(node):
if node:
yield from inorder(node.left)
yield node.data
yield from inorder(node.right)
root = Node(1)
root.left = Node(2)
root.right = Node(3)
root.left.left = Node(4)
root.left.right = Node(5)
print(list(inorder(root)))
结果
[4,2,5,1,3]
如果您希望它使用列表而不是生成器
def inorder_list(node):
accum = []
inorder_list_impl(node, accum.append)
return accum
def inorder_list_impl(node, accumulator):
if node:
inorder_list_impl(node.left, accumulator)
accumulator(node.data)
inorder_list_impl(node.right, accumulator)
你也可以使用
inorder_list_impl(root, print)
仅打印值。使用生成器
yield from
递归调用和yield
数据。