as an abstract data typea complete binary supports all the methods of binary tree adt (section )plus the following two methodsadd( )add to and return new external node storing element such that the resulting tree is complete binary tree with last node remove()remove the last node of and return its element using only these update operations guarantees that we will always have complete binary tree as shown in figure there are two cases for the effect of an add or remove specificallyfor an addwe have the following (remove is similarif the bottom level of is not fullthen add inserts new node on the bottom level of timmediately after the right-most node of this level (that isthe last node)hencet' height remains the same if the bottom level is fullthen add inserts new node as the left child of the left-most node of the bottom level of thencet' height increases by one figure examples of operations add and remove on complete binary treewhere denotes the node inserted by add or deleted by remove the trees shown in (band (dare the results of performing add operations on the trees in (aand ( )respectively likewisethe trees shown in (aand (care the results of performing remove operations on the trees in (band ( )respectively