- Courses
- Tutorials
- Practice
- Jobs
Invert Binary Tree - Change to Mirror TreeGiven the root of a binary tree, convert the binary tree to its Mirror tree.Note: Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all... Read More
TreeDSATreesMirror TreeConvert to MirrorGet the MirrorMicrosofteBayAmazonAdobeMorgan StanleySamsungVMWareMyntraBelzabarSnapdealPaytmAccoliteSAP Labstree-traversalOla CabsAmazon-QuestionSnapdeal-QuestionPaytm-QuestionMyntra-QuestioneBay-QuestionProp-Tiger-QuestionBelzabar-QuestionOLA-QuestionVMWare-Questioncpp-queue
Write a program to Delete a TreeTo delete a tree, we must traverse all the nodes of the tree and delete them one by one. So, which traversal we should use - inorder traversal, preorder traversal, or the ... Read More
Maximum Depth or Height of a Binary TreeGiven the root of a binary tree, find the maximum depth of the tree. The maximum depth or height of the tree is the number of edges in the tree from the root to the deepes... Read More
Check if Two Trees are IdenticalGiven the roots r1 and r2 of two binary trees, determine whether they are identical.Two trees are considered identical if they have the same structure and the same node va... Read More
Size of a Binary TreeGiven a binary tree, find the size of the tree. The size of a tree is the number of nodes present in the tree. Examples:Input: Output: 6Explanation: The number of nodes in... Read More
Tree Traversal TechniquesTree traversal refers to the process of visiting or accessing each node of a tree exactly once in a specific order. Unlike linear data structures such as arrays, linked li... Read More
8 queen problemGiven an 8x8 chessboard, the task is to place 8 queens on the board such that no 2 queens threaten each other. Return a matrix of size 8x8, where 1 represents queen and 0 ... Read More
Change/add only one character and print '*' exactly 20 timesIn the below code, change/add only one character and print '*' exactly 20 times.int main(){ int i, n = 20; for (i = 0; i n; i--) printf("*"); ... Read More
Condition To Print "HelloWorld"What should be the "condition" so that the following code snippet prints both HelloWorld! if "condition" printf ("Hello"); else printf("World"... Read More
Power SetPower Set P(S) of a set S is the set of all subsets of S. For example S = {a, b, c} then P(s) = {{}, {a}, {b}, {c}, {a,b}, {a, c}, {b, c}, {a, b, c}}. If S has n element... Read More
Find the Missing NumberGiven an array arr[] of size n-1 with distinct integers in the range of [1, n]. This array represents a permutation of the integers from 1 to n with one element missing. F... Read More
Implement Your Own sizeofHere is an implementation. c #includestdio.h#define my_sizeof(type) (char *)(type+1)-(char*)(type)int main(){ double x; printf(%ld, my_sizeof(x)); get... Read More
PHP Program for Largest Sum Contiguous SubarrayWrite an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum. Recommended: Please solve it on “PRA... Read More