## Range Sum Queries and Update with Square Root

Given an array A of N integers and number of queries Q. You have to answer two types of queries. Update [l, r] – for… Read More »

- Flatten a binary tree into linked list
- Print nodes in top view of Binary Tree | Set 2
- Find n-th node in Postorder traversal of a Binary Tree
- Sandvine Interview Experience for FTE 2018
- Print the nodes of binary tree as they become the leaf node
- Print cousins of a given node in Binary Tree | Single Traversal
- Print nodes in the Top View of Binary Tree | Set 3
- Preorder from Inorder and Postorder traversals
- Level Ancestor Problem
- Check if two nodes are cousins in a Binary Tree | Set-2
- 2-3 Trees | (Search and Insert)
- Find the node with maximum value in a Binary Search Tree
- Shannon-Fano Algorithm for Data Compression
- Iterative Preorder Traversal of an N-ary Tree
- Level order traversal in spiral form | Using one stack and one queue
- Flatten a binary tree into linked list | Set-2
- Number of Isosceles triangles in a binary tree
- Print all nodes between two given levels in Binary Tree
- Zig Zag Level order traversal of a tree using single queue
- Find the maximum node at a given level in a binary tree
- Iterative Segment Tree (Range Minimum Query)
- Iterative Segment Tree (Range Maximum Query with Node Update)
- Insert a node in Binary Search Tree Iteratively
- Delete leaf nodes with value k
- HashSet vs TreeSet in Java
- Sort the path from root to a given node in a Binary Tree
- Print all even nodes of Binary Search Tree
- OYO Rooms Interview Experience (On-Campus)
- Preorder Traversal of N-ary Tree Without Recursion
- Counting inversions in an array using segment tree

Given an array A of N integers and number of queries Q. You have to answer two types of queries. Update [l, r] – for… Read More »

Given a N-ary tree, the task is to print the level with the maximum number of nodes. Examples: Input : For example, consider the following… Read More »

Given a K-ary tree, where each node is having K children and each edge has some weight. All the edges i.e. K, that goes from… Read More »

Given a Binary Tree. The task is to find the maximum value among all of the right child nodes of the Binary Tree. Note: If… Read More »

Merkle tree also known as hash tree is a data structure used for data verification and synchronization. It is a tree data structure where each… Read More »

DATA COMPRESSION AND ITS TYPES Data Compression, also known as source coding, is the process of encoding or converting data in such a way that… Read More »

Given a Binary Tree, the task is to find the Coefficient of Range in it. Range is defined as the difference between the maximum and… Read More »

Given a binary tree and a node in the binary tree, find Levelorder successor of the given node. That is, the node that appears after… Read More »

Given a binary tree and a node in the binary tree, find Levelorder Predecessor of the given node. That is, the node that appears before… Read More »

Given an N-ary tree, print all the levels with odd and even number of nodes in it. Examples: For example consider the following tree 1… Read More »

Given a binary tree with as its root and for any parent its left child will be 2*i and right child will be 2*i+1. The… Read More »

Given a binary tree. First print all leaf nodes, after that remove all the leaf nodes from the tree and now print all the new… Read More »

Given a binary tree and two nodes of that binary tree. Find the sum of all nodes with odd values in the path connecting the… Read More »

Given an N-ary tree, print the number of leaf nodes in the subtree of every node. Examples: Input: 1 / \ 2 3 / |… Read More »