6.19. Summary¶

In this chapter we have looked at the tree data structure. The tree data structure enables us to write many interesting algorithms. In this chapter we have looked at algorithms that use trees to do the following:

• A binary tree for parsing and evaluating expressions.
• A binary tree for implementing the map ADT.
• A balanced binary tree (AVL tree) for implementing the map ADT.
• A binary tree to implement a min heap.
• A min heap used to implement a priority queue.