The units of a college Data Structures course, and what in B4Coder teaches each topic. Lists, stacks, queues, function calls, searching and sorting are ready today; trees, graphs and hashing are coming.
List ADT: array-based lists
Changing a list: add, update, delete
Applications of lists
Linked lists: singly, circular and doubly linked Coming soon
Polynomial ADT Coming soon
Radix sort Coming soon
Multilists Coming soon
Stack ADT: push, pop, peek
Balancing symbols
Function calls (the call stack)
Queue ADT: enqueue, dequeue
Evaluating expressions, and infix to postfix Coming soon
Circular queue and deque Coming soon
Tree ADT and traversals Coming soon
Binary trees and expression trees Coming soon
Binary search trees and AVL trees Coming soon
Priority queues: binary heaps Coming soon
B-Tree and B+ Tree Coming soon
Graphs: representation and types Coming soon
Breadth-first and depth-first traversal Coming soon
Topological sort and shortest paths (Dijkstra) Coming soon
Minimum spanning trees: Prim and Kruskal Coming soon
Linear search
Binary search
Bubble sort
Selection sort (pick the smallest, again and again)
Sorting tables of data
Insertion, shell and merge sort Coming soon
Hashing: hash functions, chaining, open addressing, rehashing Coming soon
For students
Lessons and examples are open to everyone. Challenges from Worlds 4 and 5 open in the worlds' order, and with Pro or your college's Education plan.
For teachers
Set any of these challenges and lab missions for a class, with a due date: Set a challenge → 🧱 Data Structures. See also the Datatypes challenges.
