Data Structures and Algorithms in C++ - Full Course - 2025 Edition - Beginner to Advanced

Data Structures and Algorithms in C++ - Full Course - 2025 Edition - Beginner to Advanced

Simple Snippets via YouTube Direct link

C++ PROGRAM to Convert Postfix to Infix Expression using STACK Data Structure (With Full Code) | DSA

52 of 118
Previous
Next

52 of 118

C++ PROGRAM to Convert Postfix to Infix Expression using STACK Data Structure (With Full Code) | DSA

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Data Structures and Algorithms in C++ - Full Course - 2025 Edition - Beginner to Advanced

Automatically move to the next video in the Classroom when playback concludes
  1. 1 Introduction to Data Structures & Algorithms | Course Details & Prerequisites
  2. 2 What is Data Structures? & Why we need them? DS Real World Example
  3. 3 What is Abstract Data Types(ADT) in Data Structures ? | with Example
  4. 4 What is an Algorithm ? | Data Structures and Algorithms
  5. 5 What is Stack Data Structure ? | Data Structure and Algorithms (DSA) | Part - 1
  6. 6 Stack Data Structure in C++ Programming (using arrays) | All Stack Operations | Part - 2
  7. 7 What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1
  8. 8 Queue Data Structure in C++ Programming (using arrays) | All Queue Operations | Part - 2
  9. 9 Circular Queue Data Structure with C++ Program Implementation | Data Structures & Algorithms
  10. 10 Linked List Data Structure - How Linked List works | All operations, Types & Applications
  11. 11 Singly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
  12. 12 C++ Program to Implement Singly Linked List Data Structure | Part 2 | DSA
  13. 13 Doubly Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
  14. 14 C++ Program to Implement Doubly Linked List Data Structure (Full Code) | Part - 2 | DSA
  15. 15 Circular Linked List Data Structure with all Operations & Algorithm | Part 1 | DSA
  16. 16 C++ Program to Implement Circular Linked List Data Structure (Full Code) | Part - 2 | DSA
  17. 17 Linear Search Algorithm in Data Structures | C++ Program to Implement Linear Search Algorithm
  18. 18 Binary Search Algorithm (Working, Algorithm & Diagram) in Data Structures | Part 1 | DSA
  19. 19 Binary Search Algorithm C++ Code in Data Structures | Part -2 | DSA
  20. 20 What are Sorting Algorithms | Why we need Sorting Algorithms ? | Data Structures & Algorithms | DSA
  21. 21 Selection Sort Algorithm | How Selection Sort Works with Example | Part - 1 | Sorting Algorithms DS
  22. 22 Selection Sort Algorithm C++ Code in Data Structures | Part -2 | DSA
  23. 23 Insertion Sort Algorithm | How Insertion Sort Works with Example | Part - 1 | Sorting Algorithms DS
  24. 24 Insertion Sort Algorithm C++ Code in Data Structures | Part -2 | DSA
  25. 25 Bubble Sort Algorithm | How Bubble Sort Works with Example | Part - 1 | Sorting Algorithms DS
  26. 26 Bubble Sort Algorithm with C++ Program (Full Code) | Data Structures & Algorithms | Part - 2
  27. 27 Optimized Bubble Sort Algorithm | (Algorithm with C++ Program) | Sorting Algorithms in DS
  28. 28 What is Big O notation & Time Complexity of Algorithms | Algorithm Analysis in Data Structures
  29. 29 Big Oh(O) vs Big Omega(Ω) vs Big Theta(θ) notations | Asymptotic Analysis of Algorithms with Example
  30. 30 Space Complexity of Algorithms - How to Calculate Space Complexity of Algorithms in Data Structures
  31. 31 Merge Sort Algorithm | How Merge Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA
  32. 32 Merge Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA
  33. 33 Quick Sort Algorithm | How Quick Sort Works (Example Diagram) | Part - 1 | Sorting Algorithms - DSA
  34. 34 Quick Sort Algorithm in C++ Programming | (C++ Program) | Part - 2 | Sorting Algorithms - DSA
  35. 35 Counting Sort Sorting Algorithm (Working with Diagram) | Part - 1 | Sorting Algorithms - DSA
  36. 36 Counting Sort Sorting Algorithm (C++ Program) | Part - 2 | Sorting Algorithms - DSA
  37. 37 Radix Sort(Bucket Sort) Sorting Algorithm (Working & Diagram) | Part - 1 | Sorting Algorithms - DSA
  38. 38 Radix Sort Algorithm (Step by Step Dry Running of Pseudocode) | Part - 2 | Sorting Algorithms - DSA
  39. 39 Radix Sort Sorting Algorithm (C++ Program) | Part - 3 | Sorting Algorithms - DSA
  40. 40 Shell Sort Algorithm (Theory + Working + Pseudocode) with Example | Part - 1 | Sorting Algorithms
  41. 41 C++ Program to Implement Shell Sort Algorithm (Full Code) | Part - 2 | Sorting Algorithms
  42. 42 What is Infix Prefix & Postfix Expressions in Data Structures | Why do we need them ?
  43. 43 Why Prefix & Postfix is more efficient than Infix Expressions in algorithms & arithmetic operations?
  44. 44 Infix to Prefix Conversion & vice versa WITHOUT using Stack (With Solved Examples) | Data Structures
  45. 45 Infix to Postfix Conversion & vice versa WITHOUT using Stack(With Solved Examples) | Data Structures
  46. 46 Rules to Convert Infix to Postfix Expression using STACK Data Structure (With Solved Examples) | DSA
  47. 47 PSEUDOCODE of Infix to Postfix Expression using STACK Data Structure (With Solved Example) | DSA
  48. 48 C++ PROGRAM to Convert Infix to Postfix Expression using STACK Data Structure (With Full Code) | DSA
  49. 49 Rules & Pseudocode of Infix to Prefix using Stack Data Structure (with Solved Example) | DSA
  50. 50 C++ PROGRAM to Convert Infix to Prefix Expression using STACK Data Structure (With Full Code) | DSA
  51. 51 Postfix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
  52. 52 C++ PROGRAM to Convert Postfix to Infix Expression using STACK Data Structure (With Full Code) | DSA
  53. 53 Prefix to Infix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
  54. 54 C++ PROGRAM to Convert Prefix to Infix Expression using STACK Data Structure (With Full Code) | DSA
  55. 55 Postfix to Prefix Conversion & vice versa MANUAL conversion (6 Solved Examples) | Data Structures
  56. 56 How to convert Postfix to Prefix Expression using STACK Data Structure (With Solved Example)
  57. 57 C++ PROGRAM to Convert Postfix to Prefix Expression using STACK Data Structure (Full Code) | DSA
  58. 58 Prefix to Postfix Expression using STACK Data Structure (With Solved Example) | Rules + Pseudocode
  59. 59 C++ PROGRAM to Convert Prefix to Postfix Expression using STACK Data Structure (Full Code) | DSA
  60. 60 Stack using Linked List Implementation | Working + Pseudocode + Diagram | Part - 1
  61. 61 C++ PROGRAM to Implement STACK using SINGLY LINKED LIST | (FULL CODE) | Data structures & Algorithms
  62. 62 Queue Implementation using Linked List Data Structure | Working + Pseudocode + Diagram | Part - 1
  63. 63 C++ Program to Implement Queue using Linked List (FULL CODE with Diagram) | Data structures - Part 2
  64. 64 Circular Queue Implementation using Linked List Data Structure(C++ Program with Diagram Explanation)
  65. 65 Array vs Linked List - Pros & Cons | Which data structure is better & when ? | DSA
  66. 66 What is a Tree? | Introduction to Tree Data Structure (diagram) | Important Tree Terms & Properties
  67. 67 Introduction to Binary Tree Data structure | Properties, variants & modes of implementation | DSA
  68. 68 Binary SEARCH Tree (BST) Data structure | How BST has O(log N) Time Complexity for Searching? | DSA
  69. 69 Binary Search Tree (BST) | Implementation(with Full Code) | Part 1 - Setup
  70. 70 Binary Search Tree (BST) - INSERTION operation(with C++ Code) | Part 2 - Insert New Node Operation
  71. 71 Binary Tree Traversal Techniques(with Diagram) | DFS vs BFS | DFS - Preorder vs Inorder vs Postorder
  72. 72 PreOrder Tree Traversal Technique (Full C++ Code) | DFS Tree Traversal Technique
  73. 73 InOrder Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique
  74. 74 Post Order Tree Traversal Technique (Working with Diagram & C++ Code) | DFS Tree Traversal Technique
  75. 75 Print Binary Tree Data Structure in a Graphical way (with C++ Code) on Command Prompt | DSA
  76. 76 Search Operation in Binary Search Tree (BST) | Iterative Search Technique(Full C++ Code) | DSA
  77. 77 Search Operation in Binary Search Tree (BST) using RECURSION | Recursive Search Technique (C++ Code)
  78. 78 Find Height of a Binary Tree using Recursive Function | Recursion approach | BST Implemenation | DSA
  79. 79 Breadth First Search (BFS) aka (Level Order Tree) Traversal in Binary Tree (With Full C++ Code)
  80. 80 Delete Node Operation in Binary Search Tree (BST) | Working + Pseudocode (With Full C++ Code) | DSA
  81. 81 What is Balancing a binary tree and why do we need balancing
  82. 82 What is AVL tree ? 4 Basic Rotations(Left, Right, Left-Right, Right-Left) for Balancing with Diagram
  83. 83 AVL tree Rotations - (LL RR LR RL) with more than 3 Nodes with (Diagram & Example | DSA
  84. 84 AVL Tree Insertion Example(2 Solved Problems) with Diagram & Explanation | AVL trees - DSA
  85. 85 AVL Tree Deletion Working with Diagram & Explanation (1 Solved Problem) | AVL trees - DSA
  86. 86 Insertion in Binary Search Tree (BST) using RECURSIVE FUNCTION (Working with Diagram) | DSA
  87. 87 Working of AVL Tree Insertion Operation(Recursive Method) with Rotations & Full C++ Program Code
  88. 88 AVL Tree Deletion Operation(Recursive Method) with Rotations & Full C++ Program Code
  89. 89 AVL Tree ALL Operation(Insertion, Deletion, Rotations, Balance factor, Searching) with Full C++ Code
  90. 90 What is Heap Data Structure | Types, Applications, Implementation & Standard Heap Operations
  91. 91 Heap Data Structure Implementation using Arrays | C++ Program Setup(Part - 1) | Min Heap
  92. 92 Insertion in Heap Data Structure - Step by Step Working with Diagram (With Full C++ Code) |
  93. 93 ExtractMin and Heapify in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code)
  94. 94 Delete Key Operation in Heap Data Structure - Step by Step Working with Diagram (Full C++ Code)
  95. 95 Heapsort Sorting Algorithm (Min Heap) with Working & Pseudocode | (Full C++ Program)
  96. 96 Introduction to Graph Data Structure - What is a Graph ? | Tress vs Graphs | Types & Real Examples
  97. 97 Introduction to Graph Data Structure - Graph Properties & Terminologies
  98. 98 Adjacency Matrix in Graph Data Structure | Graph Implementation
  99. 99 Adjacency List in Graph Data Structure | Graph Implementation
  100. 100 Graph Traversal techniques - Breadth First (BFS) vs Depth First (DFS)
  101. 101 Graph Data Structure (C++ Code Implementation - Part 1) | Adjacency List Implementation
  102. 102 Graph DS - Add Vertex Operation (C++ Code Implementation - Part 2) | Adjacency List Implementation
  103. 103 Graph DS - Add Edge Operation (C++ Code Implementation - Part 3) | Adjacency List Implementation
  104. 104 Graph DS - Print Graph Operation (C++ Code Implementation - Part 4) | Adjacency List Implementation
  105. 105 Graph DS - Update Edge Graph Operation (C++ Code - Part 5) | Adjacency List Implementation
  106. 106 Graph DS - Delete Edge Graph Operation (C++ Code - Part 6) | Adjacency List Implementation
  107. 107 Graph DS - Delete Vertex Graph Operation (C++ Code - Part 7) | Adjacency List Implementation
  108. 108 Graph DS - Update Vertex Graph Operation (C++ Code - Part 8) | Adjacency List Implementation
  109. 109 Graph DS - Print all Neighbours of a Vertex (C++ Code - Part 8) | Adjacency List Implementation
  110. 110 M-way(Multiway) tree & M-way Search Data structure | Binary Search tree VS M-way Search Tree | DSA
  111. 111 M-way Search Tree Data structure | Insertion & Deletion Operations | DSA
  112. 112 B-Tree Data structure | Introduction & Properties | DSA
  113. 113 B-Tree Data structure | Insertion Process with Example | DSA
  114. 114 Deleting Key in B-Tree Data structure | Deletion Process with Example | DSA
  115. 115 What is HASHING ? | Why do we NEED it? | What is a Hash Function | (Example - Array vs Hash Table)
  116. 116 What is COLLISION in Hashing? | WHY Collision occurs in Hashing ? | Collision Control & Resolution
  117. 117 Separate Chaining (Open Hashing) | Collision Control | Hashing in Data Structures
  118. 118 Closed Hashing - (Linear Probing, Quadratic Probing & Double Hashing) | Collision Control

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.