DSA

Introduction to Segment Tree

Introduction to Segment Trees The segment tree data structure is a versatile data structure widely applied in algorithmic problems in…

Binary Indexed Tree Segment Tree

August 23, 2024

DSA

Fenwick Tree [Binary Indexed Tree]

Fenwick Tree Explained The Fenwick Tree or Binary Indexed Tree is a specially efficient data structure applied for solving tasks…

Binary Indexed Tree Fenwick Tree

August 23, 2024

DSA

K D Trees [K-Dimensional Tree]

K-D Trees: A Spatial Data Structure The K-Dimensional Trees, commonly known as K-D Trees, stand out as a crucial data…

K d tree K-Dimensional Trees

August 22, 2024

DSA

Euler Tour Tree

Understanding Euler Tour Trees Understanding the Euler Tour in Graph Theory To understand the idea behind an Euler Tour Tree,…

August 22, 2024

DSA

Link-Cut Tree

Link-Cut Tree: A Dynamic Tree Data Structure A Link-Cut Tree is another complex structure, which is used to solves some…

Link-Cut Tree

August 19, 2024

DSA

Self-Balancing Binary Search Trees

Introduction to Self-Balancing Binary Search Trees Self Balancing Binary Search Trees are simple kinds of data structure that attempts to…

Binary Tree bst +1 Self-Balancing Binary Search Trees

August 19, 2024

DSA

Cartesian Tree

Understanding Cartesian Trees A sorted binary tree referred to as a Cartesian Tree is one that enjoys the features of…

Binary Tree Cartesian Tree

August 19, 2024

DSA

Scapegoat Tree

Understanding Scapegoat Trees A simple Scapegoat means Tree for insertion, deletion and search is a type of binary search tree…

August 19, 2024

DSA

Weight-Balanced Trees

Understanding Weight-Balanced Trees Weight-Balanced Trees is an abstract data type, specifically aimed at balancing with an eye on the size…

Binary Tree

August 18, 2024