找到成堆的父母

ACM-SE 28 Pub Date : 1990-04-01 DOI:10.1145/98949.99113

Fred L. Heller

{"title":"找到成堆的父母","authors":"Fred L. Heller","doi":"10.1145/98949.99113","DOIUrl":null,"url":null,"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.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Finding parents in a heap\",\"authors\":\"Fred L. Heller\",\"doi\":\"10.1145/98949.99113\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":409883,\"journal\":{\"name\":\"ACM-SE 28\",\"volume\":\"219 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM-SE 28\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/98949.99113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 28","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98949.99113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

在本文中，我们探讨了使用链接存储实现的堆ADT中添加新节点的问题。具体来说，我们提出了一个0(log(n))算法来查找下一个父节点，以保持堆的完全二叉树属性。当堆中的节点以宽度优先编号时，节点编号与树的级别之间存在关系，树的级别唯一地决定了从当前父节点到堆中的下一个父节点的路径。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Finding parents in a heap

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM-SE 28

自引率

0.00%

发文量