If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array?

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