DataStructure and Algorithms

In this tutorial we shall learn to perform 1. Get range sum 2. Update range by using Fenwick tree. Problem Statement: Given an array you need…

In this chapter we shall learn about below topics: 13.1 Need for Lazy Propagation  13.2 Working of Lazy Propagation 13.3 We shall look at an…

In this chapter we shall learn about below topics: 12.1 Partial Overlap 12.2 Total overlap 12.3 No overlap 12.4 Construct Segment Tree 12.5…

In this chapter we shall learn about below topics: 11.1 Introduction to Segment Trees 11.2 Need of Segment Tree? 11.3 Finding Sum of given…

In this chapter we shall learn about below topics: 10.1 AVL Tree Introduction 10.2 Need of AVL Tree? 10.3 LL Rotation 10.4 RR Rotation 10.5 LR…

In this chapter we shall have a look at: 9.1. Priority Queue introduction 9.2. Usage of Priority Queue 9.3. Operations that can be performed…

In this chapter we shall have a look at: 8.1. Heaps introduction 8.2. Different types of heaps 8.3. Operations that can be performed on heaps…

In this chapter we shall look at following things: 7.1. Introduction to TRIE 7.2. Insertion  7.3. Search 7.4. Auto complete 7.1. Introduction…

Implement below operations on Binary Tree 1. Insert Operation 2. Find Min 3. Find Max 4. In-order Traversal 5. Pre-order Traversal 6.…

Implement below operations on Binary Search Tree 1. Insert Operation 2. Find Min 3. Find Max 4. In-order Traversal 5. Pre-order Traversal 6.…