insertion inserting node is also easy insertion uses trickle uprather than trickle down initiallythe node to be inserted is placed in the first open position at the end of the arrayincreasing the array size by oneheaparray[nnewnoden++the problem is that it' likely that this will destroy the heap condition this happens if the new node' key is larger than its newly acquired parent because this parent is on the bottom of the heapit' likely to be smallso the new node is likely to be larger thusthe new node will usually need to be trickled upward until it' below node with larger key and above node with smaller key the insertion process is shown in figure ab swap last node to be inserted cdswap figure inserting node swap