Call Sequence for B-Tree Insert

Ref, input

Ref, output

Ref, input(const)

Ref, output

Ptr,input

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

recursion

in

in

Ref,out

Val,ptr,in

Ref,in

in

Val,in

Ref,out

Ref,out

in

Ref,in

Val,ptr

Val,in