Back to Course
Data Structures
0% Complete
0/0 Steps
-
Session 1
Data Structures - Preview Video -
Introduction to Data Structures
-
Complexity and Big O Notation
-
Static Array
-
Dynamic Arrays1 Quiz
-
Session 2Introduction to Linked lists and Nodes
-
Single Linked List Implementation 1
-
Adding and Deleting a node from a single linked list
-
Important functions for a single linked list
-
Doubly Linked List1 Quiz
-
Session 3Stack Using Arrays
-
Important Stack Class Functions
-
Stack Using Doubly Linked List
-
Queue Using Arrays
-
Circular Queue
-
Functions of The Circular Queue
-
Queue Using Doubly Linked List1 Quiz
-
Session 4Binary Search Tree
-
BST and BST Node class
-
Adding an element to a BST
-
Deleting Elements From the BST
-
Breadth First Traversal Method
-
Depth First Traverse Method
-
Other BST Class Functions1 Quiz
-
Session 5Applications of Data Structures
-
Data Structures Summary1 Quiz
Lesson 3 of 26
In Progress
Complexity and Big O Notation
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.