the array-list binary tree representation (section is especially suitable for complete binary tree we recall that in this implementationthe nodes of are stored in an array list such that node in is the element of with index equal to the level number (vof vdefined as followsif is the root of tthen ( if is the left child of node uthen ( (uif is the right child of node uthen ( ( with this implementationthe nodes of have contiguous indices in the range [ ,nand the last node of is always at index nwhere is the number of nodes of figure shows two examples illustrating this property of the last node figure two examples showing that the last node of heap with nodes has level number (aheap with more than one node on the bottom level(bheap with one node on the bottom level(carray-list representation of (darray-list representation of