Ordered Data Structures

University of Illinois at Urbana-Champaign

software-development   |   Advanced   |   16 Hours

In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.

What skills will you gain?

stack (abstract data type)

binary search algorithm

avl tree

b-tree

data type

search tree

Algorithms

Data Structures

heap (data structure)

binary search tree