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
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 arr
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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 arr
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!