Abstract
I am presently teaching a sophomore level course in Data Structures and I am using an excellent text by Thomas A. Standish. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
