Big-O

• [ ] Big - O definition
• [ ] Complexity
• [ ] Big-Omega
• [ ] Big-theta

Array-List

Array

• Search, Access, Add, Remove
  • [ ] Sorted and unsorted Array

List

• Insert, Remove
  • [ ] Singly, Doubly, Singly Circular

Recursion

• [ ] Binary search
• [ ] Squaring
• [ ] Fibonacci
• [ ] The logic to process through when implementing it

Queue

• [ ] Array-based queue
• [ ] operators

Stack

• [ ] Array-based stack
• [ ] operators
• [ ] Evaluate postfix
• [ ] Infix to Postfix

Tree

• [ ] Terms
• [ ] Pre, Post, In order Traversal
• Binary Tree
  • [ ] Properties
  • [ ] ARithmetic expression and evaluation
• [ ] Array-based Tree
• [ ] List-based Tree

Priority Queue

• [ ] Operators
• Insertion and Deletion
  • [ ] Sorted Array based PQ
  • [ ] Unsorted Array based PQ
• Sorting
  • [ ] Insertion Sort
  • [ ] Selection Sort
  • [ ] In-place Insertion-sort