Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Deleting the rightmost bottommost leaf of a heap

Deleting the rightmost bottommost leaf of a heap FEATURE ARTICLE DELETING THE RIGHTMOST BOTTOMMOST LEAF OF A HEAP following additional restriction: If leaves do exist on two adjacent levels, no additional leaves can be inserted on the higher adjacent level. Thus, if we know the number of nodes on this tree, we will know the position of the rightmost botttommost node. We will assume that the number of nodes on this binary tree is maintained throughout insertions and deletions and that number is accessible. Alan F. Lewit Professor of Computer Science University of the Virgin Islands Kingshill, VI 00850 Alewit@uvi.edu I am presently teaching a sophomore level course in Data Structures and I am using an excellent text by Thomas A. Standish 1. In a section entitled An Application Heaps and Priority Queues, a strategy is offered for fetching the value of the highest priority item at the root of a tree and replacing the roots value with the value of the rightmost leaf on the bottom row. After the value of this rightmost leaf is obtained and placed in the root, that node is deleted. If the tree used to represent the heap uses a linked object implementation, how would one go about locating the http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png 3C ON-LINE Association for Computing Machinery

Deleting the rightmost bottommost leaf of a heap

Lewit, Alan F.
3C ON-LINE , Volume 4 (4) – Oct 1, 1997
Download PDF
3 pages

Loading next page...
 
/lp/association-for-computing-machinery/deleting-the-rightmost-bottommost-leaf-of-a-heap-hDE0K6sTyx
Publisher
Association for Computing Machinery
Copyright
Copyright © 1997 by ACM Inc.
ISSN
1078-2192
DOI
10.1145/289686.289688
Publisher site
See Article on Publisher Site

Abstract

FEATURE ARTICLE DELETING THE RIGHTMOST BOTTOMMOST LEAF OF A HEAP following additional restriction: If leaves do exist on two adjacent levels, no additional leaves can be inserted on the higher adjacent level. Thus, if we know the number of nodes on this tree, we will know the position of the rightmost botttommost node. We will assume that the number of nodes on this binary tree is maintained throughout insertions and deletions and that number is accessible. Alan F. Lewit Professor of Computer Science University of the Virgin Islands Kingshill, VI 00850 Alewit@uvi.edu I am presently teaching a sophomore level course in Data Structures and I am using an excellent text by Thomas A. Standish 1. In a section entitled An Application Heaps and Priority Queues, a strategy is offered for fetching the value of the highest priority item at the root of a tree and replacing the roots value with the value of the rightmost leaf on the bottom row. After the value of this rightmost leaf is obtained and placed in the root, that node is deleted. If the tree used to represent the heap uses a linked object implementation, how would one go about locating the

Journal

3C ON-LINE – Association for Computing Machinery

Published: Oct 1, 1997

There are no references for this article.