Function result of adding elements to tree nodes as children of the node at backwards index index

result of adding elements, which are children of the node at index of tree nodes

Format:

result of adding elements to tree nodes as children of the node at backwards index index

Input:

Output:

Conditional properties that reference this function:

• if the following are true:

  • ((length of stack tree) - 1) - index = back_i
  • the element at index back_i of stack tree = node (value, cs)
  • elements of numbers that are not in tree tree = new_elements
  • result of storing (node (value, new_elements)) at index back_i of stack tree = updated

  then result of adding numbers to tree tree as children of the node at backwards index index = result of pushing values new_elements to tree updated

  (link)

• if the following are true:

  • children of the node at backwards index i of tree tree in graph graph = children
  • result of adding children to tree tree as children of the node at backwards index i = new_tree

  then output of the spanning_tree function where the input graph is graph, backwards index is i, and the spanning tree is tree = output of the spanning_tree function where the input graph is graph, backwards index is (i + 1), and the spanning tree is new_tree

  (link)

Comments

Please log in to add comments