数据结构与算法分析(C语言-英文版)教学课件05-Binary-Trees.pptVIP

Implementation of Heaps Heap representation: array-based complete binary tree representation. 12 36 24 47 85 91 53 30 Min-heap 12 36 24 85 47 30 53 91 Heap class (1) templateclass Elem class maxheap{ private: Elem* Heap; // Pointer to the heap array int size; // Maximum size of the heap int n; // Number of elems now in heap 96 83 27 38 11 9 96 83 27 11 38 9 Heap Heap class (2) int heapsize() const{return n;} bool isLeaf(int pos) const {return (pos = n/2)(pos n)}; int leftchild(int pos) const{return 2*pos+1}; int rightchild(int pos) const{return 2*pos+2}; int parent(int pos) const{return (pos-1)/2}; 96 83 27 38 11 9 Heap 96 83 27 11 38 9 0 1 2 3 4 5 6 7 8 Heap Insertion (1) 7 5 6 4 2 1 9 Insert 9 7 5 6 4 2 1 9 7 5 6 4 2 1 9 7 5 6 4 2 1 9 7 5 9 4 2 1 6 7 5 6 4 2 1 9 9 5 7 4 2 1 6 7 5 6 4 2 1 Max-Heap Heap Insertion(2) bool insert(const Elem val) { if (n = size) return false; // Heap is full int curr = n++; Heap[curr] = val; // Start at end of heap // Now sift up until currs parent curr while ((curr!=0) (Heap[curr] Heap[parent(curr)])) { swap(Heap, curr, parent(curr)); //swap curr and its parent curr = parent(curr); } } } 7 5 6 4 2 1 Heap 7 5 6 4 2 1 9 9 cur cur 0 1 2 3 4 5 6 Heap Insertion(2) bool insert(const Elem val) { if (n = size) return false; // Heap is full int curr = n++; Heap[curr] = val; // Start at end of heap // Now sift up until currs parent curr while ((curr!=0) (Heap[curr] Heap[parent(curr)])) { swap(Heap, curr, parent(curr)); //swap curr and its parent curr = parent(curr); } } 7 5 9 4 2 1 Heap 7 5 9 4 2 1 6 6 cur cur Heap Insertion(2) bool insert(const Elem val) { if (n = size) return false; // Heap is full int curr = n++; Heap[curr] = val; // Start at end of heap // Now sift up until currs parent curr while ((curr!=0) (Heap[curr] Heap[parent(curr)