Course page Home page Home pageNew course

Trees, heaps, and priority queues | Zoonk

Computer Science

22. Trees, heaps, and priority queues

Work with binary trees, search trees, heaps, tries, and priority queues. You will use them for ordered data, fast minimum or maximum access, prefixes, scheduling, and indexing.

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc