>>> q8(tree.root.left.right.right) # i的下一个节点是a
a
"""
if node.right:
node = node.right
while node.left:
node = node.left
print(node.value)
return
elif node.parent.left is node:
print(node.parent.value)
return
else:
while node.parent is not None:
if node.parent.left is node:
print(node.parent.value)
return
else:
node = node.parent
continue
print(node.value)
return
if __name__ == '__main__':
tree = Trees.BTree(with_parent=True)
tree.build(pre_ord=['a', 'b', 'd', 'e', 'h', 'i', 'c', 'f', 'g'],
in_ord=['d', 'b', 'h', 'e', 'i', 'a', 'f', 'c', 'g'])
if not doctest.testmod().failed:
print('Well Done!')
