Fred Heller

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
In tliis paper we explore the problem of adding a new node to a heap ADT implemented using linked storage. Specifically, we present an 0(log(n)) algorithm to find the next parent node in order to maintain the complete binary tree property of a heap. When the nodes in a heap are numbered breadth first, there exists a relationship between the node numbers and(More)
  • 1