1.every node stores data saying which of its children exist in the array
2.no need of any changes continue with 2w and 2w+1, if node is at i
3.keep a seperate table telling children of a node
4.use another array parallel to the array with tree
Answer:1