a. Complete Binary Tree
c.
let Node A has to b deleted.
1. Find deppest node as well as selection of deepest node which preserve structure..
2. overwrite A data with deepest node data.
3. delete deepest node.
b. finding deepest node is crucial here .. in this case 5 will be overwritten by 27.. then delete 27..