1. Data Structures

• 1.1. Array
  • 1.1.1. Binary Search
    • 1.1.1.1. Specification
    • 1.1.1.2. Basic Algorithm
    • 1.1.1.3. Complete Algorithm
• 1.2. Radix Balanced Array
  • 1.2.1. Basic Idea
  • 1.2.2. Data Structure
  • 1.2.3. Invariant
  • 1.2.4. Element Retrieval
  • 1.2.5. Element Replacement
  • 1.2.6. Element Insertion at the Rear End
  • 1.2.7. Element Deletion at the Rear End
• 1.3. B Tree
  • 1.3.1. General
  • 1.3.2. Search
  • 1.3.3. Insertion
    • 1.3.3.1. Insertion into a leaf node
    • 1.3.3.2. Insertion into an interior node
  • 1.3.4. Deletion
    • 1.3.4.1. Basic Deletion
    • 1.3.4.2. Handling of Underflow