C++ Implementation of Segment Tree
Segment Tree is one of the most important data structure in Computer Science. Similar to Binary Index Tree, a Segment Tree allows us to update and query (range) in …
Category: data structure
The Simple Implementation of Binary Index Tree (BIT or Fenwick Tree)
Introduction to Binary Index Tree or Fenwick Tree Binary Index Tree (BIT) aka Fenwick Tree is a simple data structure that has O(LogN) complexity in updating element in a …
C++ Implementation of Trie Data Structure using Hash Map
Trie is a useful data structure allow us to search a given word or check if any words start with prefix in O(N) efficient time. The following is the …
Recursive Algorithm to Compute the Linked List Jumps
You are given a singly linked list node containing positive integers. Return the same linked list where every node’s next points to the node val nodes ahead. If there’s …
Recursive Algorithm to Delete a Node from a Singly Linked List
Given a singly linked list node, and an integer target, return the same linked list with all nodes whose value is target removed. Example 1 Input node = 0 …