# Data Structure

## Stack in Data Structure

Introduction A stack is a linear data structure in which operations are done in a specific order. The order might be LIFO (Last In, First Out) or FILO (First In, Last Out). Stack example There are numerous real-world examples of stacks. Consider the canteen, where plates are heaped on top

## Priority Queue In Java

Introduction The heap data structure's functionality is provided by the PriorityQueue class. It conforms to the Queue interface. The Queue interface is implemented by the Java PriorityQueue class. Priority queue elements are retrieved in sorted order, as opposed to conventional queue elements. Assume we wish to get elements in ascending

## Trie Data Structure: Explanation and Examples

What is Trie? Trie is a sort of k-ary search tree that is used to store and search for a certain key in a set. Search complexity can be reduced to an ideal level using Trie (key length). A well-balanced BST will require time proportional to M * log N if

## A Set Data Structure (STL) In C++

Introduction In this post, we will discover what a set is, when and how to utilize it, as well as how it functions internally and the many set actions. With the help of examples, we will learn about the many STL functions that may be applied to the set. In

## Guide To 5 Data Structures In C++

Introduction As is well known, the C++ programming language provides its users with a number of interesting and practical features and functions. Additionally, object-oriented programming is supported. Some important approaches, like encapsulation, abstraction, inheritance, and polymorphism, may be carried out using this methodology. Data structures are a helpful and necessary

## Stack using Linked List in C++

Introduction A data structure called a stack uses the Last-In-First-Out (LIFO) principle. The data or element at the top of the stack, which was saved last, will be accessed first. Additionally, the top is where both insertion and deletion happen. To use the linked list to prepare a stack we

## RSA Algorithm: Concepts and Implementation

Introduction In this article we will do a deep-dive into RSA, which is a strong cryptography oriented algorithm. We will understand its origins, uses, and implementation in detail with examples along the way. Code provided will be in C++. Modern technology  makes use of the RSA Algorithm to encrypt and

## Implementing Queue using Stacks

Introduction The FIFO (First In First Out) principle, which dictates that insertion takes place from the back and deletion takes place from the front, is followed by the queue, a linear data structure. A linear data structure called a stack implements the LIFO (Last In First Out) principle, which states

## Quick Guide to Abstract Data Types

INTRODUCTION An abstract data type is a data structure abstraction that only provides the interface that the data structure must abide by. The interface provides no specifics about how something ought to be implemented or in which programming language. LIST A List is an abstract data type that is executed

## Implementing 2D Arrays in C

Introduction Multidimensional arrays are supported by the C programming language. Here is a declaration for a multidimensional array in its generic form: type name[size1][size2]...[sizeN]; For instance, the declaration that follows produces a three-dimensional integer array. int threeD[5][10][4]; 2D Arrays Introduction A two-dimensional array is