fbpx

Shopping Cart

No products in the cart.

Back to Course

Data Structures

0% Complete
0/0 Steps

  1. Session 1

    Data Structures - Preview Video
  2. Introduction to Data Structures
  3. Complexity and Big O Notation
  4. Static Array
  5. Dynamic Arrays
    1 Quiz
  6. Session 2
    Introduction to Linked lists and Nodes
  7. Single Linked List Implementation 1
  8. Adding and Deleting a node from a single linked list
  9. Important functions for a single linked list
  10. Doubly Linked List
    1 Quiz
  11. Session 3
    Stack Using Arrays
  12. Important Stack Class Functions
  13. Stack Using Doubly Linked List
  14. Queue Using Arrays
  15. Circular Queue
  16. Functions of The Circular Queue
  17. Queue Using Doubly Linked List
    1 Quiz
  18. Session 4
    Binary Search Tree
  19. BST and BST Node class
  20. Adding an element to a BST
  21. Deleting Elements From the BST
  22. Breadth First Traversal Method
  23. Depth First Traverse Method
  24. Other BST Class Functions
    1 Quiz
  25. Session 5
    Applications of Data Structures
  26. Data Structures Summary
    1 Quiz
Data Structures Complexity and Big O Notation
Lesson 3 of 26
In Progress

Complexity and Big O Notation

EurekaTech July 5, 2021

We always aim to make our programs more efficient and with high performance; therefore, in this video, we will learn about the big o notation and the complexity, so we will be able to decide whether our code is efficient or not.