## Min Query

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Skip to content
## Min Query

## Plagiarism Test

## Check SumTree

## Valid Binary Search Tree

## Convert SumTree

## Mirror Reflection

## Maximum Turns

## LevelOrder Traversal

## Ancestors

## Inorder Traversal

Concepts Used Segment Trees Difficulty Level Easy Problem Statement : Given an array of N elements and Q queries. In each query he is given two values l, r. We...

Concepts Used BFS , Recursion Difficulty Level Easy Problem Statement : Given a binary tree, and a node X, we have to sum all the nodes except the node X....

Concepts Used DFS , Recursion Difficulty Level Hard Problem Statement : "A SumTree is a Binary Tree where the value of a node is equal to sum of the nodes...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given a binary tree, determine if it is a valid binary search tree (BST). See original problem statement here...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given a binary tree and the task is to convert that tree into SumTree. See original problem statement here...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : Given two binary trees, we need to find whether one tree in the pair is the mirror image of...

Concepts Used DFS , Recursion Difficulty Level Hard Problem Statement : Given a binary tree, find the path length having maximum number of bends. See original problem statement here Solution...

Concepts Used BFS , Queue Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the level order traversal of the tree. See original problem...

Concepts Used DFS , Recursion Difficulty Level Medium Problem Statement : "Lowest common ancestor of two node n1 and n2 is the lowest node in the tree that has both...

Concepts Used DFS , Recursion, Stack Difficulty Level Easy Problem Statement : Given a binary tree, our task is to print the inorder traversal of the tree. See original problem...