DataStructures_in_C_CPP

I am goining through a course data Structures in c and c++ so this is like my notes type project which mainly helps me keep a track

This is from this hopefully incredible video from youtube https://www.youtube.com/watch?v=B31LgI4Y4DQ so lets start

⭐️ Course Contents ⭐️

• Introduction to data structures
• Data Structures: List as abstract data type
• Introduction to linked list
  • Arrays vs Linked Lists
  • Linked List - Implementation in C/C++
    • Linked List in C/C++ - Inserting a node at beginning
    • Linked List in C/C++ - Insert a node at nth position
    • Linked List in C/C++ - Delete a node at nth position
  • Reverse a linked list - Iterative method
  • Print elements of a linked list in forward and reverse order using recursion
  • Reverse a linked list using recursion
• Introduction to Doubly Linked List
  • Doubly Linked List - Implementation in C/C++
• Introduction to stack
  • Array implementation of stacks
  • Linked List implementation of stacks
  • Reverse a string or linked list using stack.
  • Check for balanced parentheses using stack
• Infix, Prefix and Postfix
  • Evaluation of Prefix and Postfix expressions using stack
  • Infix to Postfix using stack
• Introduction to Queues
  • Array implementation of Queue
  • Linked List implementation of Queue
• Introduction to Trees
  • Binary Tree
  • Binary Search Tree
    • Binary search tree - Implementation in C/C++
      • BST implementation - memory allocation in stack and heap
    • Find min and max element in a binary search tree
    • Find height of a binary tree
    • Binary tree traversal - breadth-first and depth-first strategies
      • Binary tree: Level Order Traversal
      • Binary tree traversal: Preorder, Inorder, Postorder
    • Check if a binary tree is binary search tree or not
    • Delete a node from Binary Search Tree
    • Inorder Successor in a binary search tree
• Introduction to graphs
  • Properties of Graphs
  • Graph Representation part 01 - Edge List
  • Graph Representation part 02 - Adjacency Matrix
  • Graph Representation part 03 - Adjacency List

Introduction to Data Structures

Data Structures: List as abstract data type

Introduction to linked list

• Arrays vs Linked Lists

• Linked List - Implementation in C/C++

  • Linked List in C/C++ - Inserting a node at beginning

  • Linked List in C/C++ - Insert a node at nth position

  • Linked List in C/C++ - Delete a node at nth position

• Reverse a linked list - Iterative method

• Print elements of a linked list in forward and reverse order using recursion

• Reverse a linked list using recursion

Introduction to Doubly Linked List

• Doubly Linked List - Implementation in C/C++ (link to specific implementation)

Introduction to stack

• Array implementation of stacks

• Linked List implementation of stacks

• Reverse a string or linked list using stack.

• Check for balanced parentheses using stack

Infix, Prefix and Postfix

• Evaluation of Prefix and Postfix expressions using stack

• Infix to Postfix using stack

Introduction to Queues

• Array implementation of Queue

• Linked List implementation of Queue

Introduction to Trees

• Binary Tree

• Binary Search Tree

  • Binary search tree - Implementation in C/C++

    • BST implementation - memory allocation in stack and heap

  • Find min and max element in a binary search tree

  • Find height of a binary tree

  • Binary tree traversal - breadth-first and depth-first strategies

    • Binary tree: Level Order Traversal

    • Binary tree traversal: Preorder, Inorder, Postorder

  • Check if a binary tree is binary search tree or not

  • Delete a node from Binary Search Tree

  • Inorder Successor in a binary search tree

Introduction to graphs

• Properties of Graphs

• Graph Representation part 01 - Edge List

• Graph Representation part 02 - Adjacency Matrix

• Graph Representation part 03 - Adjacency List