Skip to main content

Section 9.5 Summary

In this chapter we have looked at:
  • A binary tree to implement a min heap.
  • A min heap used to implement a priority queue.
You have attempted of activities on this page.