Scribd Logo
Upload

Welcome to Scribd!

  • Advanced Data Structures

    Uploaded by

    Vaibab Par
    7 views3 pages
    The document discusses different types of heaps, including binary heaps and double-ended heaps. A binary heap is a complete binary tree that satisfies the heap property, with the highest or lowest valued element at the root. A double-ended heap is a binary heap that allows deletions from both ends of the heap in logarithmic time.

    Original Description:

    Notes on Advanced Data Structures

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses different types of heaps, including binary heaps and double-ended heaps. A binary heap is a complete binary tree that satisfies the heap property, with the highest or lowest valued element at the root. A double-ended heap is a binary heap that allows deletions from both ends of the heap in logarithmic time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views3 pages

    Advanced Data Structures

    Uploaded by

    Vaibab Par
    The document discusses different types of heaps, including binary heaps and double-ended heaps. A binary heap is a complete binary tree that satisfies the heap property, with the highest or lowest valued element at the root. A double-ended heap is a binary heap that allows deletions from both ends of the heap in logarithmic time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    Pag Ho

    Date
    60o o320033
    Cauung Heap
    A A pain heap leunadas byse
    haap data atuntke ita selatuwnly ey
    amalemeiatien GndAuckb phachial ammoied
    -paktmana
    Paukng heapsa aap-8tlekodmutio14 tea
    Akuutuu andcanbe duneled as
    aplu ed banaciheaps
    l e4ake onuidekodauobust hoia ke
    aplemanhng 2uhu algoutaa ike PA MST
    Ayoitn M andsuppetallengolpie
    u dacdnimn koukaimnbaum element
    held meld AA Apanibleo mpoue tuo
    koot elemen feSmalex temgud Aot_
    oAtt lakges clemsinti taubker
    adoled ad:thuld al Leot
    u) nse teae ae heass
    ihdesed ument meld to eghe uaap
    dteksae- key Fxswal3u ker ooled a
    to loe de.chaodtdiepla t mele
    keu nd sdd t i badnko hegp
    W delek- mun Delees tue mamm dment
    tol)
    dhldandet culd. poin buaards nent
    siblisg ohil

    Acamohed Tihe teplksdiyi-


    Pege No
    Dele
    Bo63200123=
    Fo deleke.min Ollogn)
    Fek mun,l melol ns.extAun Ou)
    mun

    Doule cndedheap
    An A_deuble ended heap lehad a odala
    Sttau Gke piih gaue e nap bur

    aucetdui Sev Sdnpn h

    dena gtatao iuhma vey elemek


    a edaleod e pku

    kemne telemanh ottaothi aAuhalsn

    ollaiunqop an lbe pekamad


    u sta toitheuk laeapaifmpt
    u)
    a mn ketuhs ralkalotulasaumn amtnt
    ct ManAtiknkSaue omaiaum eleme
    put- AAekh elmnt n Meap s
    emauini Deleks louss aument
    AMsve Man Delehey masm dument

    Daulole endedhe hcaps an be a ut u


    hrd ombalance S7 bpleunhhg_
    Dqeialiye d daka A4kuhi Ua n-ma
    heap and pauaag hoap

    Tn tople naet olp *0(n)_

    You might also like