Function result of updating the root of tree with value

tree

Format:

result of updating the root of tree with value

Input:

Output:

Properties that reference this function:

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