Log In
Or create an account -> 
Imperial Library
  • Home
  • About
  • News
  • Upload
  • Forum
  • Help
  • Login/SignUp

Index
Preface Introduction Chapter 1: A very short C and C++ catch-up
Pointers Operator Overloading The new operator Memory allocation C++ classes Template classes Library Functions
Chapter 2: Linked Lists
A C Linked List A C++ Template Class List reversal List sort
Chapter 3: A Generic Queue Class Chapter 4: A Generic Stack Class
A demonstration calculator
Chapter 5: Introducing Binary Trees
A C binary tree A well balanced tree Tree data update Node key hashing A generic C++ class implementation The DSW Algorithm
Chapter 6: An AVL Self Balancing Tree Chapter 7: A Red Black Tree
The structure of a Red-Black tree First a C implementation Demonstration program code A generic C++ version
Chapter 8: A Splay Tree
A C implementation The generic C++ version Level Order Tree Traversal
Chapter 9: A Map Class
Red-Black Class changes A Pair Class The Map Class The Map iterator Demonstration code
Chapter 10: A Hash Table
Hashing Hash Table LP (Linear Probing) Hash Table Separate Chaining
Chapter 11: A generic Vector Chapter 12: A Binary Heap and Priority Queue
A C++ Binary Heap A Priority Queue
Chapter 13: A Generic Set Class
The Set iterator Set item comparitor Demonstration code
  • ← Prev
  • Back
  • Next →
  • ← Prev
  • Back
  • Next →

Chief Librarian: Las Zenow <zenow@riseup.net>
Fork the source code from gitlab
.

This is a mirror of the Tor onion service:
http://kx5thpx2olielkihfyo4jgjqfb7zx7wxr3sd4xzt26ochei4m6f7tayd.onion