Convert a tree to forest of even nodes Last Updated : 23 Jul, 2025 Comments Improve Suggest changes Like Article Like Report Given a tree of n even nodes. The task is to find the maximum number of edges to be removed from the given tree to obtain a forest of trees having an even number of nodes. This problem is always solvable as the given graph has even nodes.Examples: Input: Output: 2Explanation: By removing 2 edges shown below, we can obtain the forest with even node tree. Approach:The idea is to find a subtree with even number of nodes and remove it from rest of tree by removing the edge connecting it. After removal, we are left with tree with even node only because initially we have even number of nodes in the tree and removed subtree has also even node. Repeat the same procedure until we left with the tree that cannot be further decomposed in this manner.To do this, the idea is to use Depth First Search to traverse the tree. Implement DFS function in such a manner that it will return number of nodes in the subtree whose root is node on which DFS is performed. If the number of nodes is even then remove the edge, else ignore. C++ // C++ program to find maximum number to be removed // to convert a tree into a forest containing trees of // even number of nodes #include<bits/stdc++.h> using namespace std; // Return the number of nodes of subtree having // node as a root. int dfs(vector<int> tree[], vector<int>& visit, int &ans, int node) { int num = 0, cnt = 0; // Mark node as visited. visit[node] = 1; // Traverse the adjacency list to find non- // visited node. for (int i = 0; i < tree[node].size(); i++) { if (visit[tree[node][i]] == 0) { // Finding number of nodes of the subtree // of a subtree. cnt = dfs(tree, visit, ans, tree[node][i]); // If nodes are even, increment number of // edges to be removed. if (cnt % 2 == 0) { ans++; } else { // Else leave the node as // child of subtree. num += cnt; } } } return num + 1; } // Return the maximum number of edges to remove // to make the forest. int maxEdge(vector<int> tree[], int n) { vector<int> visit(n + 2, 0); int ans = 0; dfs(tree, visit, ans, 1); return ans; } int main() { int n = 10; vector<int> tree[n + 2]; // Tree structure: // // 1 // / | \ // 2 3 4 // / \ | | // 5 6 7 8 // / \ // 9 10 tree[1].push_back(2); tree[2].push_back(1); tree[1].push_back(3); tree[3].push_back(1); tree[1].push_back(4); tree[4].push_back(1); tree[2].push_back(5); tree[5].push_back(2); tree[2].push_back(6); tree[6].push_back(2); tree[3].push_back(7); tree[7].push_back(3); tree[4].push_back(8); tree[8].push_back(4); tree[8].push_back(9); tree[9].push_back(8); tree[8].push_back(10); tree[10].push_back(8); int result = maxEdge(tree, n); cout << result << endl; return 0; } Java // Java program to find maximum number to be removed // to convert a tree into a forest containing trees of // even number of nodes import java.util.ArrayList; import java.util.Arrays; class GfG { // Return the number of nodes of subtree having node as a root. static int dfs(ArrayList<Integer>[] tree, boolean[] visit, int[] ans, int node) { int num = 0, cnt; // Mark node as visited. visit[node] = true; // Traverse the adjacency list to find non-visited node. for (int neighbor : tree[node]) { if (!visit[neighbor]) { // Finding number of nodes of the subtree // of a subtree. cnt = dfs(tree, visit, ans, neighbor); // If nodes are even, increment number of edges to remove. if (cnt % 2 == 0) { ans[0]++; } else { // Else leave the node as child of subtree. num += cnt; } } } return num + 1; } // Return the maximum number of edges to remove // to make forest. static int maxEdge(ArrayList<Integer>[] tree, int n) { boolean[] visit = new boolean[n + 1]; int[] ans = {0}; Arrays.fill(visit, false); // Perform DFS from node 1 dfs(tree, visit, ans, 1); return ans[0]; } public static void main(String[] args) { int n = 10; // Tree structure: // // 1 // / | \ // 2 3 4 // / \ | | // 5 6 7 8 // / \ // 9 10 ArrayList<Integer>[] tree = new ArrayList[n + 1]; for (int i = 0; i < n + 1; i++) { tree[i] = new ArrayList<>(); } tree[1].add(2); tree[2].add(1); tree[1].add(3); tree[3].add(1); tree[1].add(4); tree[4].add(1); tree[2].add(5); tree[5].add(2); tree[2].add(6); tree[6].add(2); tree[3].add(7); tree[7].add(3); tree[4].add(8); tree[8].add(4); tree[8].add(9); tree[9].add(8); tree[8].add(10); tree[10].add(8); System.out.println(maxEdge(tree, n)); } } Python # Python program to find maximum number to be removed # to convert a tree into a forest containing trees of # even number of nodes def dfs(tree, visit, ans, node): num = 0 # Mark node as visited. visit[node] = True # Traverse the adjacency list to find # non-visited node. for neighbor in tree[node]: if not visit[neighbor]: # Finding number of nodes of the subtree. cnt = dfs(tree, visit, ans, neighbor) # If nodes are even, increment number of # edges to remove. if cnt % 2 == 0: ans[0] += 1 else: # Else leave the node as child of subtree. num += cnt return num + 1 # Return the maximum number of edge to remove # to make forest. def maxEdge(tree, n): visit = [False] * (n + 1) ans = [0] # Perform DFS from node 1 dfs(tree, visit, ans, 1) return ans[0] if __name__ == '__main__': n = 10 # Tree structure: # # 1 # / | \ # 2 3 4 # / \ | | # 5 6 7 8 # / \ # 9 10 tree = [[] for _ in range(n + 1)] tree[1].append(2) tree[2].append(1) tree[1].append(3) tree[3].append(1) tree[1].append(4) tree[4].append(1) tree[2].append(5) tree[5].append(2) tree[2].append(6) tree[6].append(2) tree[3].append(7) tree[7].append(3) tree[4].append(8) tree[8].append(4) tree[8].append(9) tree[9].append(8) tree[8].append(10) tree[10].append(8) print(maxEdge(tree, n)) C# // C# program to find maximum number to be removed // to convert a tree into a forest containing trees of // even number of nodes using System; using System.Collections.Generic; class GfG { // Return the number of nodes of subtree having node as a root. static int dfs(List<int>[] tree, bool[] visit, ref int ans, int node) { int num = 0, cnt; // Mark node as visited. visit[node] = true; // Traverse the adjacency list to find non-visited node. foreach (int neighbor in tree[node]) { if (!visit[neighbor]) { // Finding number of nodes of the subtree. cnt = dfs(tree, visit, ref ans, neighbor); // If nodes are even, increment number // of edges to remove. if (cnt % 2 == 0) { ans++; } else { // Else leave the node as child of subtree. num += cnt; } } } return num + 1; } // Return the maximum number of edges to remove // to make forest. static int maxEdge(List<int>[] tree, int n) { bool[] visit = new bool[n + 1]; int ans = 0; // Perform DFS from node 1 dfs(tree, visit, ref ans, 1); return ans; } static void Main(string[] args) { int n = 10; // Tree structure: // // 1 // / | \ // 2 3 4 // / \ | | // 5 6 7 8 // / \ // 9 10 List<int>[] tree = new List<int>[n + 1]; for (int i = 0; i < n + 1; i++) { tree[i] = new List<int>(); } tree[1].Add(2); tree[2].Add(1); tree[1].Add(3); tree[3].Add(1); tree[1].Add(4); tree[4].Add(1); tree[2].Add(5); tree[5].Add(2); tree[2].Add(6); tree[6].Add(2); tree[3].Add(7); tree[7].Add(3); tree[4].Add(8); tree[8].Add(4); tree[8].Add(9); tree[9].Add(8); tree[8].Add(10); tree[10].Add(8); Console.WriteLine(maxEdge(tree, n)); } } JavaScript // JavaScript program to find maximum number to be removed // to convert a tree into a forest containing trees of // even number of nodes function dfs(tree, visit, ans, node) { let num = 0; // Mark node as visited. visit[node] = true; // Traverse the adjacency list to find non-visited node. for (let neighbor of tree[node]) { if (!visit[neighbor]) { // Finding number of nodes of the subtree. let cnt = dfs(tree, visit, ans, neighbor); // If nodes are even, increment number // of edges to remove. if (cnt % 2 === 0) { ans.count++; } else { // Else leave the node as child of subtree. num += cnt; } } } return num + 1; } // Return the maximum number of edges to remove // to make forest. function maxEdge(tree, n) { const visit = new Array(n + 1).fill(false); const ans = { count: 0 }; // Perform DFS from node 1 dfs(tree, visit, ans, 1); return ans.count; } const n = 10; // Tree structure: // // 1 // / | \ // 2 3 4 // / \ | | // 5 6 7 8 // / \ // 9 10 const tree = Array.from({ length: n + 1 }, () => []); tree[1].push(2); tree[2].push(1); tree[1].push(3); tree[3].push(1); tree[1].push(4); tree[4].push(1); tree[2].push(5); tree[5].push(2); tree[2].push(6); tree[6].push(2); tree[3].push(7); tree[7].push(3); tree[4].push(8); tree[8].push(4); tree[8].push(9); tree[9].push(8); tree[8].push(10); tree[10].push(8); console.log(maxEdge(tree, n)); Output2 Time Complexity: O(n), where n is the number of nodes in tree.Auxiliary Space: O(n) For taking visiting array. Comment More infoAdvertise with us K kartik Improve Article Tags : Tree DSA DFS Practice Tags : DFSTree Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. It’s the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview CornerThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160Are you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like