Tag: Discrete Mathematics

• Trie Data Structure
  The Trie data structure is used to store a set of keys represented as strings. It allows for efficient retrieval and storage of keys, making it highly effective
• Need for Abstract Data Type and ADT Model
  Prerequisite: Abstract Data Types or ADT Why Abstract Data Type became a necessity?
• Count inversions in an array | Set 4 ( Using Trie )
  Inversion Count for an array indicates – how far (or close) the array is from being sorted. If the array is already sorted then inversion count is 0. If the arr
• How to swap Keys with Values of a Map in C++?
  Given a map, the task is to swap the Keys of this map with its values, in C++. Examples:
• Queries to update a given index and find gcd in range
  Given an array arr[] of N integers and queries Q. Queries are of two types: 
• Introduction to R-tree
  R-tree is a tree data structure used for storing spatial data indexes in an efficient manner. R-trees are highly useful for spatial data queries and storage. So