implementation throughout our discussionwe have used the abstract view of binary tree with nodes and edges to illustrate the heap structure while heap is binary treeit' seldomif everimplemented as dynamic linked structure due to the need of navigating the tree both top-down and bottom-up insteadwe can implement heap using an array or vector to physically store the individual nodes with implicit links between the nodes suppose we number the nodes in the heap left to right by level starting with zeroas shown in figure (awe can then place the heap values within an array using these node numbers as indices into the arrayas shown in figure ( ( (bfigure heap can be implemented using an array or vector node access since heap is complete treeit will never contain holes resulting from missing internal nodes thusthe root will always be at position within the array and its two children will always occupy elements and in factthe children of any given node will always occupy the same elements within the array this allows us to quickly locate the parent of any node or the left and right child of any node given the array index of nodethe index of the parent or children of that node can be computed asparent ( - / left right