Thank you for the info. But I still am a bit lost,is a heap the same as a binary tree? For example:
A heap is initialized(with build_heap),starting with an array with the following strings:
what would the heap array look like?
If the strings are inserted one at a time,in order,into a initially empty heap. Would it look any different than the initialized array?