Introduction The Java util package provides a versatile data structure known as the PriorityQueue. This is essentially an implementation of a priority queue using a binary heap. By default, it works as a min-heap, but by passing a custom comparator, it can function as a max-heap. In this guide, we’ll explore the nuances of using […]
Using Java’s Priority Queue as Min-Heap and Max-Heap Read More »
Introduction The Set interface in Java Collections Framework represents a collection that doesn’t allow duplicate elements. This blog post will delve into the fundamentals of the Set interface and look into its commonly used implementations like HashSet, TreeSet, and LinkedHashSet. What is a Set? A Set is an unordered collection of elements where duplicates are
Java Collections API: Mastering the Set Interface Read More »
Introduction Maps are essential data structures in programming, and Java offers a comprehensive suite of map implementations through its Collections Framework. This blog post will serve as a guide to understanding the Map interface and its most common implementations: HashMap, TreeMap, and LinkedHashMap. What is a Map? In Java, a Map is an object that
Java Collections API: A Guide to the Map Interface Read More »
The Java Collections Framework is a set of interfaces and classes in the Java Standard Library that provides a unified architecture for representing and manipulating collections, such as lists, sets and maps. It offers out-of-the-box solutions for common data structures and algorithms, allowing developers to save time, write safer code, and focus on application logic
Java Collections API: Understanding the List Interface Read More »
Introduction A Trie, pronounced as “try,” is a tree-like data structure that is used to store an associative array where the keys are usually strings. Unlike binary trees, which have a maximum of two children (left and right), tries can have multiple children, one for each letter in the alphabet. Tries are particularly useful for
Implementing a Trie Data Structure in Python Read More »
Introduction Graphs are a versatile data structure that can represent anything from social networks to web pages and their interconnections. A graph consists of vertices (also known as nodes) and edges that connect pairs of vertices. In this blog post, we’ll explore the fundamentals of graph theory and implement a simple, undirected graph in Python.
Implementing a Graph Data Structure in Python Read More »
Introduction A heap is a special tree-based data structure that satisfies the heap property. It is mainly used to implement priority queues. A heap can be visualized as a binary tree filled on almost all levels, except that the last level might not be completely filled and it’s filled from left to right. In a
Implementing a Heap Data Structure in Python Read More »
Introduction A Hash Set is a data structure that stores unique elements in no particular order. Just like a hash map, a hash set uses a hash table for storage, but it only stores keys, not key-value pairs. In this blog post, we’ll discuss the hash set data structure and implement one from scratch in
Implementing a Hash Set Data Structure in Python Read More »
Introduction Hash maps, also known as hash tables or dictionaries, are data structures that provide fast access, insertion, and deletion operations. The basic idea behind a hash map is to use a hash function to map keys to indices in an array, where the corresponding values can be stored. In this blog post, we’ll walk
Implementing a Hash Map Data Structure in Python Read More »
Introduction A Binary Search Tree (BST) is a tree-based data structure that has the following properties: In this blog post, we’ll dive deep into implementing a Binary Search Tree in Python. Structure of a Binary Search Tree A simple Binary Search Tree can be visually depicted like this: Here, 15 is the root node, and
Implementing a Binary Search Tree in Python Read More »