data structures using true or false fill in the blanks binary heap is complete binary tree in min heapthe root node has the highest key value in the heap an element at position has its parent stored at position / all levels of binary heap except the last level are completely filled in min-heapelements at every node will be greater than its left and right child binomial tree bi has nodes binomial heaps are ordered fibonacci heaps are rooted and ordered the running time of min_binomial-heap(procedure is (log if there are roots in the root lists of and then merge_binomial-heap(runs in ( log mtime fibonacci heaps are preferred over binomial heaps an element at position in the array has its right child stored at position heaps are used to implement heaps are also known as in elements at every node will either be less than or equal to the element at its left and right child an element is always deleted from the the height of binomial tree bi is binomial heap is defined as binomial tree bi has nodes binomial heap is created in time fibonacci heap is in fibonacci heapmark[xindicates