Linked Lists (LL) Implementation / Coding:
- Concept of link
- Creating a Linked List (LL)
- Appending a node to LL
- Display of LL
- Length of LL (count)
- Reversing of LL
- Sorting
- Adding node at Start of LL
- Inserting node in between of LL
- Deleting a node
- Creating a Double LL
- Appending a node to Double LL
- Display of Double LL
- Length of Double LL (count)
- Reversing of Double LL
- Inserting a node in between a Double LL
- Rotate Double LL
- Count Pairs with criteria for a Double LL
- Questions
- Circular LL overview (access pointers)
- Creating a Circular LL
- Adding node at Start Circular LL (approach 1)
- Traversal / Display Circular LL (approach 1)
- Inserting node in between a Circular LL (approach 1)
- Deleting a node
- Adding node at End Circular LL (approach 2)
- Traversal / Display Circular LL (approach 2)
- Circular LL – Queue (Adding Node)
- Circular LL – Queue (Removing Node)
- Questions
Stacks (Implementation / Coding):
- Stack overview
- Stack with Array
- Expressions
- Evaluation of Postfix expression
- Infix to Post fix
- Evaluation of Prefix overview. infix to prefix overview
- Application: Finding next big element
- Stack using Linked List
- Reversing Stack with Linked List
- Questions
Queues (Implementation / Coding) :
- Queue Overview
- Queue using Array
- Priority Queue with Array
- Queue using Linked List
- Priority Queue using Double Linked List
- Questions
Recursion
- Recursion Overview, Phases, Types
- Recursive Functions
- Linked List operations using Recursion
- Questions
Trees
- Binary Trees
- Tree Traversals
- Inorder
- preorder
- postorder
- Binary Search Trees (BST)
- BST – Insertion
- BST – Insertion & Traversals
- Traversals Explained
- BST – Search
- Search operations
- BST Deletion
- Deletion cases
- Binary Tree to BST conversion
- Identify a Tree to be BST
- Identify zero, one child nodes of BST
- Questions
Sorting
- Selection Sort
- Selection Sort Analysis
- Bubble Sort
- Bubble Sort Analysis
- Insertion Sort
- Insertion Sort Analysis
- Quick Sort
- Quick Sort Analysis
- Quick Sort, Merge Sort Discussion
- Questions
Topics of Data Structures and interaction
Who this course is for:
- fresh students, C programmers
How to Enroll Live Coding with Data Structures for campus/internship/jobs course?
How many members can access this course with a coupon?
Live Coding with Data Structures for campus/internship/jobs Course coupon is limited to the first 1,000 enrollments. Click 'Enroll Now' to secure your spot and dive into this course on Udemy before it reaches its enrollment limits!
