Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Treap Data Structure: Combining BSTs and HeapsIntroduction The Treap is a fascinating hybrid data structure that combines the properties of a Binary Search Tree (BST) and a Heap. It is designed to maintain both the binary search property of BSTs and the heap property based on priorities. This du...10 likesTreap
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Euler Tour Technique for Tree ProblemsIntroduction Trees are one of the most fundamental data structures in computer science. They are widely used to represent hierarchical structures, such as organizational charts, file systems, and network routing tables. One of the most powerful techn...10 likesEulerTour
Arka Infotecharkainfotech.hashnode.dev·Jan 11, 2025Fenwick Tree vs Segment Tree: Which One to Use?Introduction In the world of data structures, Fenwick Trees and Segment Trees are two powerful tools used to solve range query problems efficiently. Both are designed to perform fast updates and queries on an array, but they differ significantly in t...10 likesCompetitiveProgramming
