CS Project 4: PQueue
Tree
Stored as a Vector of references to nodes
Each order
Has order number of children n-1 order
enqueue

Take existing Vector of nodes, and attempt to insert another Vector of nodes.

Second vector is order 0 tree, consisting of only elem

Take first vectors 0th order, add to children the second vector

if firstVector[0].children.size() is greater than 2^order+1

carryOver(int order)
Takes overflowing order and moves it until proper order is reached.
   Login to remove ads X
Feedback | How-To