Find the Root of a Tree from the Sum of Child Node IDs Last Updated : 12 Dec, 2024 Comments Improve Suggest changes Like Article Like Report Given a Binary Tree with nodes labelled from 1 to n, where n is the total number of nodes. The task is to identify the root of binary tree given that each node is described by a pair consisting of its id and the sum of its children's id's.Examples: Input: [[1, 5], [2, 0], [3, 0], [4, 0], [5, 5], [6, 5]]Output: 6Explanation: In this question, two trees having 6 as their root node can me generated. Input: [[4, 0]Output: 4Explanation: 4 is the only node in a tree and thus does not have any child as well.Approach:The idea is to use the property that every node id, except for the root, appears in the sum of children ids. By calculating the total sum of all node id's and subtracting it to the total sum of all children sum, the difference will be the id of the root node. C++ // C++ Program to Find root of tree where children // sum for every node id is given. #include <bits/stdc++.h> using namespace std; int findRoot(vector<pair<int, int>> &arr) { // Subtract the sum of children // from the sum of all nodes int root = 0; for (int i = 0; i < arr.size(); i++) { // Add the node Id to the root root += arr[i].first; // Subtract the sum of children root -= arr[i].second; } return root; } int main() { vector<pair<int, int>> arr = {{1, 5}, {2, 0}, {3, 0}, {4, 0}, {5, 5}, {6, 5}}; // The given array represents the following binary tree // 6 6 // \ / \ // 5 1 4 // / \ \ // 1 4 5 // / \ / \ // 2 3 2 3 int res = findRoot(arr); cout << res << endl; return 0; } Java // Java Program to Find root of tree where // children sum for every node id is given. class GfG { static class pair { int first, second; public pair(int first, int second) { this.first = first; this.second = second; } } static int findRoot(pair arr[]) { // Subtract the sum of children // from the sum of all nodes int root = 0; for (int i = 0; i < arr.length; i++) { // Add the node Id to the root root += arr[i].first; // Subtract the sum of children root -= arr[i].second; } // Return the root of the tree return root; } public static void main(String[] args) { pair arr[] = { new pair(1, 5), new pair(2, 0), new pair(3, 0), new pair(4, 0), new pair(5, 5), new pair(6, 5) }; // The given array represents the following binary // tree // 6 6 // \ / \ // 5 1 4 // / \ \ // 1 4 5 // / \ / \ // 2 3 2 3 System.out.print(findRoot(arr)); } } Python # Python Program to Find root of tree where # children sum for every node id is given. def findRoot(arr) : # Subtract the sum of children # from the sum of all nodes root = 0 for i in range(len(arr)): # Add the node Id to the root root += arr[i][0] # Subtract the sum of children root -= arr[i][1] # Return the root of the tree return root if __name__ == '__main__': arr = [[1, 5], [2, 0], [3, 0], [4, 0], [5, 5], [6, 5]] #The given array represents the following binary tree # 6 6 # \ / \ # 5 1 4 # / \ \ # 1 4 5 # / \ / \ # 2 3 2 3 print(findRoot(arr)) C# // C# Program to Find root of tree where // children sum for every node id is given. using System; class GfG { public class pair { public int first, second; public pair(int first, int second) { this.first = first; this.second = second; } } static int findRoot(pair[] arr) { // Subtract the sum of children // from the sum of all nodes int root = 0; for (int i = 0; i < arr.Length; i++) { // Add the node Id to the root root += arr[i].first; // Subtract the sum of children root -= arr[i].second; } // Return the root of the tree return root; } static void Main(String[] args) { pair[] arr = { new pair(1, 5), new pair(2, 0), new pair(3, 0), new pair(4, 0), new pair(5, 5), new pair(6, 5) }; // The given array represents the following binary // tree // 6 6 // \ / \ // 5 1 4 // / \ \ // 1 4 5 // / \ / \ // 2 3 2 3 Console.Write(findRoot(arr)); } } JavaScript // JavaScript to Find root of tree where // children sum for every node id is given. function findRoot(arr) { // Subtract the sum of children // from the sum of all nodes let root = 0; for (let i = 0; i < arr.length; i++) { // Add the node Id to the root root += arr[i][0]; // Subtract the sum of children root -= arr[i][1]; } // Return the root of the tree return root; } let arr = [ [ 1, 5 ], [ 2, 0 ], [ 3, 0 ], [ 4, 0 ], [ 5, 5 ], [ 6, 5 ] ]; // The given array represents the following binary tree // 6 6 // \ / \ // 5 1 4 // / \ \ // 1 4 5 // / \ / \ // 2 3 2 3 console.log(findRoot(arr)); Output6 Time Complexity: O(n), Where n is the length of the given array.Auxiliary Space: O(1), As no extra space is used. Comment More infoAdvertise with us Next Article Binary Tree (Array implementation) S Sunidhi Improve Article Tags : Misc Tree DSA Practice Tags : MiscTree Similar Reads Binary Tree Data Structure A Binary Tree Data Structure is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. It is commonly used in computer science for efficient storage and retrieval of data, with various operations such as insertion, deletion, and 3 min read Introduction to Binary Tree Binary Tree is a non-linear and hierarchical data structure where each node has at most two children referred to as the left child and the right child. The topmost node in a binary tree is called the root, and the bottom-most nodes are called leaves. Introduction to Binary TreeRepresentation of Bina 15+ min read Properties of Binary Tree This post explores the fundamental properties of a binary tree, covering its structure, characteristics, and key relationships between nodes, edges, height, and levelsBinary tree representationNote: Height of root node is considered as 0. Properties of Binary Trees1. Maximum Nodes at Level 'l'A bina 4 min read Applications, Advantages and Disadvantages of Binary Tree A binary tree is a tree that has at most two children for any of its nodes. There are several types of binary trees. To learn more about them please refer to the article on "Types of binary tree" Applications:General ApplicationsDOM in HTML: Binary trees help manage the hierarchical structure of web 2 min read Binary Tree (Array implementation) Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent node of that particular index (or node). The value of the root node index would always be -1 as there is no parent for root. Construct the standard linked representation o 6 min read Maximum Depth of Binary Tree Given a binary tree, the task is to 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 deepest node.Examples:Input: Output: 2Explanation: The longest path from the root (node 12) goes through node 8 to node 5, which has 11 min read Insertion in a Binary Tree in level order Given a binary tree and a key, the task is to insert the key into the binary tree at the first position available in level order manner.Examples:Input: key = 12 Output: Explanation: Node with value 12 is inserted into the binary tree at the first position available in level order manner.Approach:The 8 min read Deletion in a Binary Tree Given a binary tree, the task is to delete a given node from it by making sure that the tree shrinks from the bottom (i.e. the deleted node is replaced by the bottom-most and rightmost node). This is different from BST deletion. Here we do not have any order among elements, so we replace them with t 12 min read Enumeration of Binary Trees A Binary Tree is labeled if every node is assigned a label and a Binary Tree is unlabelled if nodes are not assigned any label. Below two are considered same unlabelled trees o o / \ / \ o o o o Below two are considered different labelled trees A C / \ / \ B C A B How many different Unlabelled Binar 3 min read Types of Binary TreeTypes of Binary TreeWe have discussed Introduction to Binary Tree in set 1 and the Properties of Binary Tree in Set 2. In this post, common types of Binary Trees are discussed. Types of Binary Tree based on the number of children:Following are the types of Binary Tree based on the number of children: Full Binary TreeDe 7 min read Complete Binary TreeWe know a tree is a non-linear data structure. It has no limitation on the number of children. A binary tree has a limitation as any node of the tree has at most two children: a left and a right child. What is a Complete Binary Tree?A complete binary tree is a special type of binary tree where all t 7 min read Perfect Binary TreeWhat is a Perfect Binary Tree? A perfect binary tree is a special type of binary tree in which all the leaf nodes are at the same depth, and all non-leaf nodes have two children. In simple terms, this means that all leaf nodes are at the maximum depth of the tree, and the tree is completely filled w 4 min read Like