Part 4. Heap

Exercise 7. A d-ary tree is a generalization of a binary tree in which each internal node has d children. Using Eytzingers method it is also possible to represent complete d-ary trees using arrays. Work out the equations that, given an index i, determine the index of is parent and each of is d children in this representation.