def check_node_elements(output, tree_array, value):
tree = Tree()
tree.add(tree_array)
node_str = tree.print_node(value)
is_correct = check_separeted_text(output, node_str)
assert is_correct, '\nОжидал: {}\nПолучил: {}\n'.format(node_str, output)
def check_tree_by_array(output, tree_array):
tree = Tree()
tree.add(tree_array)
tree_str = tree.print_tree()
is_correct = check_separeted_text(output, tree_str)
assert is_correct, '\nОжидал дерево:\n{}\nПолучил:\n{}\n'.format(tree_str, output)
def BstInorderFindFirstKeyLargerThan(v, tree):
candidate = None
curr = tree.get()
while curr:
if curr.v > v:
candidate = curr.v
curr = curr.l
else:
curr = curr.r
return candidate
if __name__ == "__main__":
tree = Tree()
tree.add(19)
tree.add(7)
tree.add(43)
tree.add(3)
tree.add(11)
tree.add(23)
tree.add(47)
tree.add(2)
tree.add(5)
tree.add(17)
tree.add(37)
tree.add(53)
tree.add(13)
tree.add(29)
tree.add(41)
tree.add(31)
