D-heap as heap – like structure where every node can have at most d successors. Other properties of standard heap structure are sustained (i.e. tree shape,label’s partial order). Find a method which allows to represent,in an effective way,the d-heap in an array. With this approach design a DelMin algorithm for the d-heap. Prove the algorithm correctness and estimate its complexity according specification
I am an IITK graduate, 9 year experienced software professional and I have got top notch developers in my team, who have got experience across a span of technologies. The members in my team have worked with top notch tech organization such as Amazon, Cisco, Oracle etc. We have been involved in similar projects in the past and our track record has been excellent.