Podcast Ch 22 b Title Inserting into a

Podcast Ch 22 b • Title: Inserting into a Heap • Description: Overview; inserting into a heap; push. Heap method • Participants: Barry Kurtz (instructor); John Helfert and Tobie Williams (students) • Textbook: Data Structures for Java; William H. Ford and William R. Topp

Heaps • A maximum heap is an array‑based tree in which the value of a parent is ≥ the value of its children. A minimum heap uses the relation ≤.

For each tree, indicate whether it is a heap (maximum or minimum) or is not a heap. (a) Maximum heap Minimum heap No heap (b) Maximum heap Minimum heap No heap (c) Maximum heap Minimum heap No heap

Inserting into a Heap • Assume that the array the elements in the index range 0 i < last < n form a heap. – The new element will enter the array at index last with the heap expanding by one element.

Inserting into a Heap (cont) • Insert item into a heap by moving nodes on the path of parents down one level until the item is assigned as a parent that has heap ordering. Path of parents for insertion of item = 50

Inserting into a Heap (cont) • The static method push. Heap() of the class Heaps inserts a new value in the heap. The parameter list includes the array arr, the index last, the new value item, and a Comparator object of type Greater or Less indicating whether the heap is a maximum or minimum heap.

Inserting into a Heap (continued) • The algorithm uses an iterative scan with variable curr. Pos initially set to last. At each step, compare the value item with the value of the parent and if item is larger, copy the parent value to the element at index curr. Pos and assign the parent index as the new value for curr. Pos. The effect is to move the parent down one level. Stop when the parent is larger and assign item to the position curr. Pos.

Inserting into a Heap (continued)

Start with the min heap show below. Draw the heap after inserting 25.

push. Heap() // // // the array elements in the range (0, last) are a heap; insert item into the heap so that the range (0, last+1) is a heap; use the Comparator comp to perform comparisons public static <T> void push. Heap(T[] arr, int last, T item, Comparator<? super T> comp) { // assume the new item is at location // arr[last] and that the elements arr[0] // to arr[last-1] are in heap order int curr. Pos, parent. Pos; // curr. Pos is an index that traverses // path of parents; item is assigned // in the path curr. Pos = last; parent. Pos = (curr. Pos-1)/2;

push. Heap() (concluded) // traverse path of parents up to the root while (curr. Pos != 0) { // compare target and parent value if (compare(item, arr[parent. Pos]) < 0) { // move data from parent position to // current position; update current position // to parent position; compute next parent arr[curr. Pos] = arr[parent. Pos]; curr. Pos = parent. Pos; parent. Pos = (curr. Pos-1)/2; } else // heap condition is ok; break; } // the correct location has been discovered; // assign target arr[curr. Pos] = item; }

For each of the following array-based trees, identify all of the properties that are valid. 1. 2. 3. 4. 5. maximum heap minimum heap sorted tree (array used to build the tree is sorted) tree in which every level has all possible nodes binary search tree Tree (a) has properties: Tree (b) has properties: Tree (c) has properties: Tree (d) has properties: Tree (e) has properties: _________________________ _____________