Function smallest value in tree

find smallest tree

Format:

smallest value in tree

Input:

any tree -

Output:

number - None

Properties that reference this function:

smallest value in (node (a, (node (l, ll, lr)), right)) = smallest value in (node (l, ll, lr)) (find nearest larger)
smallest value in (node (a, None, right)) = a (find nearest larger finished)

Conditional properties that reference this function:

  • if the following are true:

    • val = a
    • tree = node (a, (node (l, ll, lr)), (node (r, rl, rr)))
    • smallest value in (node (r, rl, rr)) = near

    then output of the bst_delete function where input tree is tree, value is val, visited is visited, and moves are moves = result of building the BST from nodes [ result of updating the root of (result of removing near from tree tree) with near, visited ] and moves moves

    (link)


Comments

Please log in to add comments