Find the Level of a Binary Tree with Width K
Given a Binary Tree and an integer K, the task is to find the level of the Binary Tree with width K. If multiple levels… Read More »
Given a Binary Tree and an integer K, the task is to find the level of the Binary Tree with width K. If multiple levels… Read More »
Given an initial array, A[] and a final array B[] both of size N containing integers from the range [1, N], where A[] represent the… Read More »
C++ filter_none edit close play_arrow link brightness_4 code // C++ code #include <iostream> #include <utility> using namespace std; int main() { // Declaring the… Read More »
Given two integers N and M, the task is to find out smallest number of operations required to convert N to M. Each operation involves… Read More »
Given a two dimensional grid, each cell of which contains integer cost which represents a cost to traverse through that cell. The task is to… Read More »
Given a binary tree, write a function that returns true if the tree satisfies below property: For every node, data value must be equal to… Read More »
Given two integers A and B, the task is to find the minimum positive integer N such that N is divisible by A and the… Read More »
Given the root of a binary tree and a key x in it, find the distance of the given key from the root node. Distance… Read More »
Given a Queue of integers. The task is to check if consecutive elements in the queue are pairwise consecutive.Examples: Input: 1 2 5 6 9… Read More »
Given an array of elements, the task is to insert these elements in level order and construct a tree. Input : arr[] = {10, 20,… Read More »
Given a binary tree and data value of a node. The task is to find the sum of cousin nodes of given node. If given… Read More »
Given an array of integers and a number K with initial and final values. Your task is to find the minimum number of steps required… Read More »
Given lengths of n rods in an array a[]. If any person picks any rod, half of the longest rod (or (max + 1) /… Read More »
Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. You… Read More »
Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from the root node.Example: 1… Read More »