Tutorials
Courses

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Python21.3K+ articles

Experiences16.6K+ articles

Interview Experiences14.2K+ articles

JavaScript12.2K+ articles

School Learning11.5K+ articles

Java10.8K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Java-DSA

32 posts

Java Program to Implement Minimum Spanning Tree

Last Updated: 30 May 2024

A Minimum Spanning Tree (MST) is a fundamental concept in graph theory and computer science particularly in the field of network optimization. It represents the minimum se...read more

article_image

Sentinel Linear Search in Java

Last Updated: 27 May 2024

The Linear search is a simple searching algorithm that checks every element in the list or array sequentially until the target element is found or the end of the list is r...read more

Heap implementation in Java

Last Updated: 27 May 2024

A heap is a binary tree-based data structure that adheres to a heap property. In a heap, every parent node has a specific relationship with its children: in a max-heap, ea...read more

article_image

Java Program to Implement B+ Tree

Last Updated: 13 June 2024

The B+ tree is a self-balancing tree data structure commonly used in database and file systems applications. It is an extension of B-Tree and maintains sorted data in a ma...read more

Trie Data Structure in Java

Last Updated: 27 May 2024

A Trie Data Structure is nothing but it is a tree-like data structure which is used to efficiently store and retrieve the dynamic set of Strings or Keys. It is certainly u...read more

article_image

Last Updated: 30 May 2024

A B-tree is a self-balanced tree data structure that will maintain the sorted data and allow for operations such as insertion, deletion and search operations. B-tree is pa...read more

article_image

Segment Tree in Java

Last Updated: 30 May 2024

A Segment Tree is a binary tree used for storing intervals or segments. It is allowed to query sum, minimum, maximum or other associative operations over the range of elem...read more

article_image

Red Black Tree Java

Last Updated: 13 June 2024

A Red-Black Tree is a self-balancing binary search tree where each node contains an extra bit for the storing colour either red or black. This structure ensures that the t...read more

article_image

Huffman Coding Java

Last Updated: 27 June 2024

The Huffman coding is a popular algorithm used for lossless data compression. It works by assigning the variable-length codes to the input characters with the shorter code...read more

Java Program to Construct K-D Tree

Last Updated: 27 June 2024

A K-D Tree (K-Dimensional Tree) is a space-partitioning data structure designed for organizing points in a K-dimensional space. It's particularly efficient for nearest nei...read more

AVL Tree program in Java

Last Updated: 04 April 2025

AVL tree stands for Adelson-Velsky and Landis tree. An AVL tree is a type of self-balancing binary search tree. In an AVL tree, the height of two child subtrees of any of ...read more

article_image

Balanced Binary Tree in Java

Last Updated: 27 June 2024

A Balanced Binary Tree is the type of binary tree where the difference in the heights between left and right subtrees of any node is at the most one. This property ensures...read more

article_image

Java Program to Solve the Fractional Knapsack Problem

Last Updated: 13 June 2024

The Fractional Knapsack Problem is a classic optimization problem that falls under the category of greedy algorithms. Given a set of items, each with a weight and a value,...read more

Java Program to Implement Fibonacci Heap

Last Updated: 27 June 2024

Fibonacci heaps are an effective data structure that may be used to create priority queues. They provide better reduced time complexity than conventional binary heaps for ...read more

article_image

Kruskal's Algorithm in Java

Last Updated: 08 July 2024

Kruskal's Algorithm is the popular algorithm used to find the Minimum Spanning Tree (MST) of the connected, undirected graph. The MST of the graph is the subset of its edg...read more