ProDeveloperTutorial.com

Problem Statement Given a binary tree, invert it Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */ Output: /* * 10 * / \ * 12 8 *…

Problem Statement: Given a binary tree and two nodes, check if they are cousins Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */…

Problem Statement: Given two trees, check if the tree is subtree of another tree. Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14…

Problem Statement: You are given a root of a subtree, you need to return all the duplicate subtrees You need to return the root of each…

Problem Statement: Given a binary tree, check if duplicate values are present Example: Input: /* * 10 * / \ * 8 10 * / \ / \ * 2 9 11 14 */…

Problem Statement: Given a binary tree, check if the tree is a children sum property . Meaning, each root is a sum of its immediate two…

Problem Statement: Given a binary tree and a target, burn it. Below is the burning sequence. Fire will spread to the connected nodes. Each…

Problem Statement: Given a binary tree and a target, delete leaf nodes having value target Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2…

Problem Statement: Given a binary tree, find the maximum path sum between two leaves. Solution Explanation: The solution needs to consider any…

Problem Statement: You are given a binary tree and a target node and a value k. You need to find all the nodes at a distance k from the given…