Rohit Gawanderohit253.hashnode.dev路Nov 9, 2024Chapter 47 -Segment Trees: The Final Chapter of My DSA JourneyHey everyone! 馃帀 I鈥檓 thrilled to share that this is the last chapter in my DSA with Java series! It鈥檚 been an incredible journey, and I鈥檓 excited to wrap it up with an important topic: Segment Trees. Segment trees are a powerful data structure, used ...software development
Akshaya Biswalakshaya-biswal.hashnode.dev路Aug 17, 2024Heap DSA heap is a specialized binary tree-based data structure that satisfies the heap property. Max-Heap: In a max-heap, for any given node I, the value of I is greater than or equal to the values of its children. The largest value is at the root. Min-H...Data Structures and Algorithms in JavaScriptDSA
Jayanth H Sjayanthhs.hashnode.dev路Sep 25, 2023Convert BST to Max HeapGiven a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap with the condition that all the values in the left subtree of a node should be less than all the values in the right subtre...47 readsalgorithms
Ishan Gaurlearnwithgaur.hashnode.dev路Nov 24, 2022Understand The Heap Implementation - Data Structure And AlgorithmsHey guys! Welcome to the new article on Data Structure. Today we will be talking about a very interesting data structure called Heap. Do not confuse Heap and priority Queue as it is the same thing, Why? I will be clearing it up in this article stay t...1 like路42 readsData Structure & AlgorithmsBlogsWithCC
