Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    2.7 Heaps

    Uploaded by

    Harshit

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    2.7 Heaps

    Uploaded by

    Harshit
    5 views9 pages

    Original Title

    PPT 2.7 Heaps

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    5 views9 pages

    2.7 Heaps

    Uploaded by

    Harshit

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 9

    Department of Computer Science and Engineering (CSE)

    UNIVERSITY INSTITUTE OF
    ENGINEERING
    COMPUTER SCIENCE
    ENGINEERING
    Bachelor of Engineering
    Design and Analysis of
    Algorithms(CST-302/ITT-302)
    Chapter 2
    Prepared By: Amrita Chaudhary (E8745)
    Topic: Heaps DISCOVER . LEARN . EMPOWER

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    Learning Objectives & Outcomes


    Objective:
    • To understand the Heap and its types.

    Outcome:
    • Student will understand
     Heap and its types

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    Heap

    • A Heap is a special Tree-based data structure in which


    the tree is a complete binary tree. Generally, Heaps can be
    of two types:
    • Max-Heap: In a Max-Heap the key present at the root
    node must be greatest among the keys present at all of
    it’s children. The same property must be recursively true
    for all sub-trees in that Binary Tree.
    • Min-Heap: In a Min-Heap the key present at the root
    node must be minimum among the keys present at all of
    it’s children. The same property must be recursively true
    for all sub-trees in that Binary Tree.

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    Methods or Operations of Heap

    • find - find an item in a heap.


    • insert - add an item in a heap ensuring the heap property
    is maintained min-heap and max-heap property.
    • delete - remove an item in a heap.
    • extract - return the value of an item and then delete from
    heap.
    • replace - extract or pop the root and insert or push a
    new item in a heap ensuring the heap property has
    maintained min-heap and max-heap property.

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    Methods or Operations of Heap (Contd..)

    • Apart from the above mentioned basic operations, there


    are other operations such as:
    • size - returns the size of heap.
    • is-empty - returns 'true' if heap is empty or 'false' if it
    has value.
    • merge - joining or union of two heaps, all the values from
    both heaps are included but the original heaps are
    preserved.
    • meld - joining of two heaps where the values from both
    heaps are included but the original heaps are destroyed.

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    REFERENCES
    Text books:
    •Cormen, Leiserson, Rivest, Stein, “Introduction to Algorithms”, Prentice Hall of
    India, 3rd edition 2012. problem, Graph coloring.
    •Horowitz, Sahni and Rajasekaran, “Fundamentals of ComputerAlgorithms”,
    University Press (India), 2nd edition

    Websites:
    1.https://www.tutorialspoint.com/data_structures_algorithms/
    heap_data_structure.htm
    2.https://www.geeksforgeeks.org/

    University Institute of Engineering (UIE)


    Department of Computer Science and Engineering (CSE)

    Summary
    Introduction to Heaps
    • Basic terms

    Types of Heaps
    • Max-heap
    • Min-heap

    University Institute of Engineering (UIE)


    THANK YOU

    University Institute of Engineering (UIE)

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy