Please enable JavaScript.

Coggle requires JavaScript to display documents.

Heap - Coggle Diagram

- - - - Only the most left-down leaves can be missing
  - - - 2.The root of a heap always contains its largest element
        
        3.A node of a heap considered with all its descendants is also a heap.
        
        4.A heap can be implemented as an array by recording its elements in the top- down, left-to-right fashion
        
        The parental node keys will be in the first floor(n/2) positions of the array,
        
        the leaf keys will occupy the last (n/2) positions;
        
        The children of a key in the array’s parental position i (1 ≤ i ≤ n/2) will be in positions 2i and 2i + 1
        
        the parent of a key in position i (2 ≤ i ≤ n) will be in position i/2
        
        hus, we could also define a heap as an array H [1..n] in which every element in position i in the first half of the array is greater than or equal to the elements in positions 2i and 2i + 1, i.e.,
- - - - Total number of keys comparisions
        
        2(n − log 2(n + 1))