Functions

Functions process one or more input values and produce an output value. Click on a function to read more about it.

interrupt at index: i time: t

interrupt at computer: id index: i time: t

disk bytes read at time t

disk byte at index: i time: t

the instruction at computer id and index i

network bytes read from computer: id at time t

char in decimal

Expression Stack at time s

Context Stack at time s

expression value at time s

towers of hanoi towers

length of elements is odd

length of elements is even

move disk towers is even

move disk towers

move one towers

get subtowertower

get subtower maptower

find other one

find other one

towers of hanoi top disks towers

towers of hanoi top towers

height of tree n

Height of a tree tree and index index

node (value, left, right)

node (value, children)

tree node contains value

result of inserting value to tree tree

output of the bst_insert function where input tree is tree, value is value and index is index

output of the bst_insert function where the input tree is tree, value is value, visited is visited, and moves are moves

result of removing value from tree tree

pop value from tree tree

output of the bst_delete function where input tree is tree, value is value, visited is visited, and moves are moves

result of balancing the tree tree

result of rotating tree clockwise

result of rotating tree twice

find referece to node index in tree tree

find root index in tree

find parent index of tree

find parent index of tree

find nearest largertree

find nearest largertree

smallest value in tree

result of updating the root of tree with value

result of building the BST from nodes nodes and moves moves

result of AVL insert of tree tree and value value

result of halving the stack s

output of the halve stack function where input stack is s, other stack is other, and count is value

result of merge sorting s

result of merging stacks s1 and s2

output of the merge_stacks function where input stacks are s1 and s2, and merged stack is r

get adjacent nodes nodes

get adjacent nodes helpnodes

children of the node at backwards index index of tree tree in graph graph

children of the node value in graph graph

get children help graph

output of the find_neighbors function where the input graph is graph, node is value, and children are children

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

result of pushing values elements to tree tree

maximum value in graph

spanning tree of graph graph starting at node root

spanning tree of graph

output of the spanning_tree function where the input graph is graph, backwards index is index, and the spanning tree is tree

tree tree contains value

elements of values that are not in tree tree

output of the not_in_tree function where the input tree is tree, the values are values, and the new values are result

result of pushing nodes elements into tree tree where parent is index and parent distance is distance

shortest path from node value to every other node in graph graph

output of the shortest_path function where the input graph is graph, backwards index is index, and tree is tree

result of adding or updating children pairs of the node at backwards index index in tree tree

edge (left, right, weight)

node (value, distance, index)

result of splitting pairs into nodes that exist in the tree tree and new nodes

output of the separate_nodes function where the input tree is tree, the nodes are pairs, the existing group is old, and the new group is new

result of updating nodes children in tree tree with parent index index and parent distance distance

spanning DFT tree of graph graph starting from value

output of the build_dft_tree function where input graph is graph, tree is tree, and neighbor stack is stack

nodes with values values and parent parent

output of the make_nodes function where input values are values, parent is parent, and nodes are result

2 3