Advanced Data Structure

DBMS

B and B+ Trees

Difference Between

Difference between Binary Tree and Binary Search Tree

Last Updated: 14 September 2024

Binary Tree Data Structure:A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can ha...read more

Binary Search Tree

Computer Organization & Architecture

Computer Subject

Data Structures

Difference Between

Design a Chess Game

Last Updated: 05 December 2022

Problem Statement: The problem is to design a Chess Game using Object Oriented Principles.Asked In: Adobe, Amazon, Microsoft, etc.Solution: ...read more

Algorithms

Java-Object Oriented

Design Pattern

Object-Oriented-Design

Marketing

System Design

STL Priority Queue for Structure or Class

Similar Topics

DSA

22.3k+ articles

Arrays

6.4k+ articles

Strings

3.2k+ articles

Competitive Programming

2.3k+ articles

Algorithms

2k+ articles

Tree

1.4k+ articles

Data Structures

1.1k+ articles

array-range-queries

360+ articles

Segment-Tree

140+ articles

Trie

85+ articles

Last Updated: 09 October 2023

STL priority_queue is the implementation of Heap Data-structure. By default, it's a max heap and we can easily use it for primitive datatype ...read more

Heap

priority-queue

Ordered Set and GNU C++ PBDS

Last Updated: 19 November 2019

Prerequisite :Basic knowledge of STL and Sets Data structure. About ordered set Ordered set is a policy based data structure in g++ that k ...read more

Technical Scripter

Competitive Programming

C++

cpp-set

Disjoint Set Data Structures

Last Updated: 22 February 2025

A disjoint-set data structure is defined as one that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping ...read more

union-find

Fibonacci Heap | Set 1 (Introduction)

Last Updated: 23 August 2024

INTRODUCTION:A Fibonacci heap is a data structure used for implementing priority queues. It is a type of heap data structure, but with sever...read more

Heap

Fibonacci

How to design a tiny URL or URL shortener?

Last Updated: 03 January 2025

How to design a system that takes big URLs like "https://cdn.geeksforgeeks.org/count-sum-of-digits-in-numbers-from-1-to-n/" and converts the ...read more

System Design

Design a data structure that supports insert, delete, search and getRandom in constant time

Last Updated: 14 September 2024

Design a data structure that supports the following operations in O(1) time.insert(x): Inserts an item x to the data structure if not alread ...read more

Amazon

Hash

Binomial Heap

Last Updated: 02 September 2024

The main application of Binary Heap is to implement a priority queue. Binomial Heap is an extension of Binary Heap that provides faster unio...read more

Heap

Search and Insertion in K Dimensional tree

Last Updated: 13 June 2023

What is K dimension tree?A K-D Tree(also called as K-Dimensional Tree) is a binary search tree where data in each node is a K-Dimensional po...read more

Inorder predecessor and successor in BST

Last Updated: 04 December 2024

Given a BST and a key, the task is to find the inorder successor and predecessor of the given key. In case the given key is not found in BST...read more

Binary Search Tree

Deletion in Red-Black Tree

Last Updated: 29 December 2023

Deletion in a red-black tree is a bit more complicated than insertion. When a node is to be deleted, it can either have no children, one chi...read more

Self-Balancing-BST

Red Black Tree

Delete Operation in B-Tree

Last Updated: 24 February 2025

A B Tree is a type of data structure commonly known as a Balanced Tree that stores multiple data items very easily. B Trees are one of the m...read more

Skip List - Efficient Search, Insert and Delete in Linked List

Last Updated: 04 September 2024

A skip list is a data structure that allows for efficient search, insertion and deletion of elements in a sorted list. It is a probabilistic...read more