Question $5$: You are given a complete binary tree $($i$.$e$.,$ all leaves are at the same level and

the bottom level is full$).$ The levels are numbered $0$; $1$; $2$; : : : ; d $1$ and the number n of

nodes satises n $=2$d $1.$ Each node u in this tree stores an integer value$($u$).$