Call Sequence for B-Tree Insert

Insert(newentry)

Ref, input

Push-down(current,  newentry,  median,  right-branch)

recursion

Search_node(current, target, position)

Push-in( current,entry, right_branch, position)

Split_node(current,extra_entry,extra_branch,position,right_half,median)

Ptr,input

Ref,
input(const)

Ref,
output

Ref,
output

in

in

Ref,out

Val,ptr,in

Ref,in

in

Val,in

Ref,out

Ref,out

Val,in

Val,ptr

Ref,in

in