When a binary tree heap is stored internally as an array, the data at index 4 of the array has a right child node at index ____ When a binary tree heap is stored internally as an array, the data at index 10 of the array has a parent node at index ____ Using text definition, insert 4, 9, 3, 7, 2, 5, 8, 6 into a binary tree heap. I end up with 2 at the root.
Which data is at the bottom of the heap?
Now remove the 2, 3, and 4, from your heap in above question, then which data is at the root:?