Binary Trees: Maximum Sum of nodes in Binary tree such that no two are adjacent
Problem Statement: You are given an binary tree, you need to return the sum of the nodes such that no two nodes are adjecent. It means, if we…
Binary Trees: Find largest subtree sum in a tree
Problem Statement: Given a binary tree, you need to find the subtree with maximum sum in tree. Example Input : 1 / \ -2 3 / \ / \ 4 5 -6 2…
Binary Trees: Check if a given graph is tree or not
Problem Statement: You are given an undirected graph, you need to check if the graph is a tree or not. Example In the below image, first graph…
Binary Trees: Find Duplicate Subtrees
Problem Statement: You are given a binary tree, you need to find all the duplicate sub trees. Example Input : 1 / \ 2 3 / / \ 4 2 4 / 4 Output…
Binary Trees: Minimum swap required to convert binary tree to binary search tree
Problem Statement: You are given an array representation of a complete binary tree. You need to find the minimum swaps required to convert…
Binary Trees: Construct Binary Tree from preorder and inorder traversal
Problem Statement: You are given 2 arrays with inorder and pre-order. You need to construct a binary tree with the given array. Example Input:…
Binary Trees: Convert Binary tree into Sum tree
Problem Statement: You are given an binary tree, you need to convert into sum tree. Example Solution We can solve this problem with the help…
Binary Trees: Convert Binary Tree to DLL
Problem Statement: You are given a binary tree, you need to convert into DLL. Example In-place convert Binary Tee to a Doubly Linked List 4…
Binary Trees: Diagonal Traversal of a Binary tree
Problem Statement: You are given a binary tree, you need to traverse diagonal and print the nodes. Example The diagonal traversal is :…
Linked List: Segregate even and odd nodes in a Linked List
Problem Statement: You are given an LL, you need to segregate the list such that all the even number appear before all the odd numbers in the…