## Check whether every node of binary tree has a value K on itself or its any immediate neighbours

Given a binary tree and a value K, the task is to check if every node of the binary tree has either value of the… Read More »

- Breadth First Search without using Queue
- Minimum time to burn a Tree starting from a Leaf node
- Print all nodes at distance K from given node: Iterative Approach
- Check if given words are present in a string
- Level order traversal in spiral form | Using Deque
- Real-time application of Data Structures
- Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative
- Find distance between two nodes in the given Binary tree for Q queries
- Print Palindromic Paths of Binary tree
- Split a BST into two balanced BSTs based on a value K
- Sum of all nodes at Kth level in a Binary Tree
- Boundary Level order traversal of a Binary Tree
- Print all pairs from two BSTs whose sum is greater than the given value
- Check if a string is a scrambled form of another string
- Diamond Tree
- Paranthesis Theorem
- Duplicates Removal in Array using BST
- Shortest path in a directed graph by Dijkstra’s algorithm
- Least Common Ancestor of any number of nodes in Binary Tree
- Deletion of a given node K in a Binary Tree using Level Order Traversal
- Count the number of visible nodes in Binary Tree
- Dynamic Segment Trees : Online Queries for Range Sum with Point Updates
- XOR of elements in a given range with updates using Fenwick Tree
- Count nodes in the given tree whose weight is a fibonacci number
- Sum and Maximum of elements in array from [L, R] before and after updates
- Range Sum and Update in Array : Segment Tree using Stack
- Maximum pair sum in the given index ranges of an Array
- Check if Inorder traversal of a Binary Tree is palindrome or not
- Find the maximum Even Digit Sum node in the given tree
- Print all Exponential Levels of a Binary Tree

Given a binary tree and a value K, the task is to check if every node of the binary tree has either value of the… Read More »

Given a Binary Tree, the task is to count all paths from root to leaf which forms an Arithmetic Progression. Examples: Input: Output: 2 Explanation:… Read More »

Given a number in form of string str and an integer K, the task is to find the smallest integer that can be formed after… Read More »

Given a Binary Tree, the task is to perform Specific Level Order Traversal of the tree such that at each level print 1st element then… Read More »

Prerequisites: Policy based data structure, Sliding window technique. Given an array of integer arr[] and an integer K, the task is to find the median… Read More »

Given a Binary Tree, the task is to find the maximum value of Bitwise AND from any path from the root node to the leaf… Read More »

Prerequisites: Diameter of a N-ary tree Path between two nodes in a graph Given a N-ary tree with N nodes numbered from 0 to N-1… Read More »

Given a binary tree, the task is to find the absolute difference between the even valued and the odd valued nodes in a binary tree.… Read More »

Prerequisite: Introduction of B+ trees In this article, we will discuss that how to insert a node in B+ Tree. During insertion following properties of… Read More »

Given a binary tree consisting of N nodes, the task is to print the nodes that are just above the leaf node. Examples: Input: N… Read More »

Given a Binary Tree, the task is to print the nodes that have grandchildren. Examples: Input: Output: 20 8 Explanation: 20 and 8 are the… Read More »

Given a Binary Tree and a positive integer K. The task is to check whether the Balanced BST of size K exist in a given… Read More »

Given two nodes of a binary tree v1 and v2, the task is to check if two nodes are on the same path in a… Read More »

Given a binary tree, the task is to print the longest path from the root node to the leaf node. If there are multiple answers… Read More »

Given an undirected graph, the task is to count the maximum number of Bridges between any two vertices of the given graph. Examples: Input: Graph… Read More »