Java Implementation of Trie Data Structure
Trie is a tree-based data structure used for efficient retrieval of a key in a huge word set. In this post, we will implement the Trie data structure in Java.
Tag: Beginner
Treap Data Structure
A Treap data structure is basically a combination of a binary search tree and a heap.
Static Linked List – C, Java, and Python
We have discussed the linked list data structure, which is dynamic in nature (the memory is allocated during the run time). Now the question that might be on a few people’s minds is – can a linked link be implemented statically as well? This post tries to answer this question.
Linked List – Insertion at Tail | C, Java, and Python Implementation
This post will discuss various methods to implement a linked list by inserting it at the tail of the singly linked list.
Linked List Implementation in C
This post will discuss various linked list implementation techniques in detail and construct a singly linked list in the C programming language.
Introduction to Linked Lists
A linked list is a linear data structure consisting of a group of nodes where each node point to the next node through a pointer. Each node is composed of data and a reference (in other words, a link) to the next node in the sequence.
Introduction to Pattern Matching
Given a text, find all occurrences of a given pattern in it. The goal is to find all occurrences of pattern P[1…m] of length m in the given text T[1…n] of length n.
Min Heap and Max Heap Implementation in Java
In previous post, we have introduced the heap data structure and covered heapify-up, push, heapify-down and pop operations. This article covers Java implementation of Priority Queue Data Structure (Max Heap and Min heap).
Stack Implementation in Java
A stack is a linear data structure that follows the LIFO (Last–In, First–Out) principle. That means the objects can be inserted or removed only at one end of it, also called a top.
Queue Implementation in Java
This article covers queue implementation in Java. A queue is a linear data structure which follows the FIFO (first-in first-out) principle. That means the object which is inserted first will be the first one out, followed by the object which was inserted next.
Queue Implementation in C++
This article covers queue implementation in C++. A queue is a linear data structure that serves as a container of objects that are inserted and removed according to the FIFO (First–In, First–Out) principle.
Stack Implementation in C++
In this article, C++ implementation of stack data structure is discussed using a class. A stack is a linear data structure that serves as a container of objects that are inserted and removed according to the LIFO (Last–In, First–Out) rule.