14. Trees and associative data structures

This section introduces what the standard library refers to as “associative data structures” - non-sequential data structures.

• 14.1. Tree ADT concepts
  • 14.1.1. The tree ADT
• 14.2. Binary Search Trees
  • 14.2.1. The Binary Search Tree ADT
  • 14.2.2. Searching binary trees
  • 14.2.3. Inserting into binary trees
  • 14.2.4. Erasing binary tree nodes
• 14.3. Binary Search Tree iterators
  • 14.3.1. BST iterator begin() and end()
  • 14.3.2. BST iterator operator++()
  • 14.3.3. Implementing BST iterators
• 14.4. Using parent pointers
• 14.5. Priority queues
  • 14.5.1. Heaps
  • 14.5.2. Percolate up
  • 14.5.3. Percolate down
• 14.6. The set class
  • 14.6.1. Variations on std::set
• 14.7. The map class
  • 14.7.1. Selected map functions
  • 14.7.2. Map structure
  • 14.7.3. Variations on std::map

You have attempted of activities on this page