• 09 December

    Stack Implementation in C++ using Linked List

    In this article, we will see how to implement stack in C++ using linked list. Stack as an Abstract data Type Stack is an ordered data structure to store datatypes in LIFO (Last In First Out) order. That means the element which enters last are first to exit(processed). It’s like a bunch of concentric rings […]

  • 09 December

    Queue Implementation in C++

    This article is about queue implementation using array in C++. Queue as an Abstract data Type Queue is an ordered data structure to store datatypes in FIFO (First in First Out) order. That means the element which enters first is first to exit(processed). It’s like the normal queue in front of any ticket counter. Of […]

  • 06 December

    Stack implementation in C++

    This article is about stack implementation using array in C++. Stack as an Abstract data Type Stack is an ordered data structure to store datatypes in LIFO (Last In First Out) order. That means the element which enters last is first to exit(processed). It’s like a tower of concentric rings kept one over other. Of […]

  • 22 October

    Binary search in C++

    This article is about binary search and its implementation in C++. What is Binary Search? The word ‘Binary’ actually refers to ‘two’. So, it’s anticipatable that there will be something related to ‘two’. In case of linear search, we start from the beginning of an array and keep checking gradually. Now, there may be cases […]