Function pop value from tree tree
tree pop tree
Format:
pop value from tree tree
Input:
list tree -
number value -
Output:
list - None
Properties that reference this function:
result of removing value from tree tree = result of balancing the tree (pop value from tree tree) (tree deletion)
Conditional properties that reference this function:
if the following are true:
- index of value value in tree = i
- the element at index i of stack tree = node (value, (-1), (-1))
- find parent index of tree = p
- the element at index p of stack tree = node (pval, pleft, i)
then pop value from tree tree = result of storing (node (pval, pleft, (-1))) at index p of stack tree
(link)if the following are true:
- index of value value in tree = i
- the element at index i of stack tree = node (value, left, (-1))
- the element at index left of stack tree = node (lvalue, lleft, lright)
- find parent index of tree = p
- the element at index p of stack tree = node (pval, pleft, i)
then pop value from tree tree = result of storing (node (value, (-1), (-1))) at index i of stack (result of storing (node (pval, pleft, left)) at index p of stack tree)
(link)if the following are true:
- index of value value in tree = i
- the element at index i of stack tree = node (value, (-1), right)
- the element at index right of stack tree = node (rvalue, rleft, rright)
- find parent index of tree = p
- the element at index p of stack tree = node (pval, i, pright)
then pop value from tree tree = result of storing (node (value, (-1), (-1))) at index i of stack (result of storing (node (pval, right, pright)) at index p of stack tree)
(link)if the following are true:
- index of value value in tree = i
- find nearest largertree = n
- the element at index n of stack tree = node (larger, nleft, nright)
- the element at index i of stack tree = node (value, left, right)
then pop value from tree tree = result of storing (node (larger, left, right)) at index i of stack (pop larger from tree tree)
(link)
Comments
Please log in to add comments