Topics

Here is a list of all topics with brief descriptions:

[detail level 123]

▼Low level containers
▼Binary trees	Objects implemented as binary trees
Binary tree	An unbalanced binary tree
Binary heap	A binary tree organized as a heap
Red-black tree	A self-balancing binary tree
▼Linked lists	Collection of linked lists
Doubly-linked list	A linked list allowing traversal in both directions
Singly-linked list	A linked list allowing traversal in the forward direction
Hash table	A hash table utilizing separate chaining for collision resolution
▼High level containers
String	Vector-like memory management of a collection of characters
Array	Dynamically-allocated, fixed size array
Map	A container of key/value pairs with unique keys
Vector	Variable-sized array
▼Smartish pointers	Non-automatic smart pointers
Guarded pointers	Object to guard against direct copying of pointers
Unique Pointers	Dynamically-allocated memory with a single owner
Shared Pointers	Reference-counted, dynamically-allocated memory
Weak Pointers	Non-"owning" reference to a shared pointer