CJCoding With Joseph
Search questions, topics, or languages
15free / daySign inCreate account

Data Structures & Algorithms / 43 lessons

Data Structures & Algorithms

Unlock the secrets of data structures and algorithms in this all-in-one course, crafted to give you everything you need to succeed. Whether you’re new or looking to gain a complete understanding, our lessons go deep into key concepts like linked lists, stacks, queues, trees, and sorting algorithms - making them simple and engaging. We combine theory with hands-on examples, showing exactly how these structures work, so by the end, you’ll have truly mastered them.

Preview only. You can read the start of every lesson here. A membership unlocks all of them.See plans

Big O Notation

  1. 001Big O Notation
  2. 002Big O Examples and Practice
  3. 003Big O Proof
  4. 0046 Practice Proof Examples

Stacks

  1. 005Intro To Stacks
  2. 006Adding an Item to the Stack
  3. 007Removing From A Stack
  4. 008Peeking Into A Stack (Top Function)
  5. 009Checking If A Stack Is Empty
  6. 010Check If The Stack Is Full
  7. 011Displaying The Stack
  8. 012Stack With Linked List Implementation

Queues

  1. 013Intro To Queues
  2. 014Using Stacks In Queues
  3. 015Transferring The Stack
  4. 016Enqueue An Element
  5. 017Dequeue An Element
  6. 018Front Operation
  7. 019Check If The Queue Is Empty
  8. 020Displaying The Queue
  9. 021Testing Your Queue
  10. 022Implementing Queues With Arrays

Linked Lists

  1. 023Intro To Linked Lists
  2. 024Header File For A Linked List
  3. 025Writing the Constructor
  4. 026Adding is_empty()
  5. 027Implement push_front()
  6. 028Adding Nodes With push_back()
  7. 029Making push_at_n()
  8. 030Find Nodes With get_node_at()
  9. 031Get Nodes With get_node_by_value()
  10. 032Remove Nodes With remove_at_n()
  11. 033Get The Size With size()
  12. 034Display Your Linked List With print_list()
  13. 035Delete The Linked List With The Destructor
  14. 036Testing Your Linked List

Trees and Heaps

  1. 037Intro to Binary Search Trees (BSTs)
  2. 038BST — Core Structure and Methods
  3. 039AVL Tree
  4. 040Min Heap
  5. 041Max Heap

Sorting Algorithms

  1. 042Bubble Sort
  2. 043Insertion Sort