Notes on Data Structures and Algorithms in C++

• Sorting
  • Merge Sort
• Sorting continued
  • Shell Sort
• Union Find
• Sample Algorithms using stack<>
  • Postfix to Infix Algorithm
  • Find directed path
  • Binary Expression Tree
• Heap and Priority Queues
  • Description
  • Max Heap Operations
  • Code of Array Implementation of Max Heap
  • C++ Code
• Radix Sort
  • Discussion
  • Source Code
• Binary Search Trees Implemented using std::unique_ptr
  • Discussion Links
  • Class Overview
  • Source Code
• Binary Search Tree Implementation Using std::shared_ptr
  • insertion
  • copy construction and copy assignment and move construction and assigment
  • remove
  • The complete code
• Traversal Algorithms
  • General References on BST Traversal
  • Iterative Traversals
• Multiway Trees
  • Description
  • Use of Multiway Trees
  • Souce
• Implementing a 2 3 Tree in C++17
  • Discussion Links
  • Implementation Overview
• Implementing a 2 3 4 Tree in C++17
  • General Description of a 2-3-4 Tree
  • How Insertion and Removal Algorithms Maintain a Balanced 2 3 4 Tree
  • Implementation of class tree234
• Red Black Trees (under develpment)
  • Basic Description and Examples of Red Black Trees
  • B-Trees Defined
  • Relationship Between 2-3-4 trees and Red Black Trees
  • Resources
  • Red Black Tree Implementations