Finding parents in a heap

Abstract

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 the level of the tree which uniquely determines a path from the current parent node to the next parent node in a heap.