Given an integer ‘K’ and a binary tree in string format. Every node of a tree has value in range from 0 to 9. We need to find product of elements at K-th level from root. The root is at level 0.
Note : Tree is given in the form: (node value(left subtree)(right subtree))
Input : tree = "(0(5(6()())(4()(9()())))(7(1()())(3()())))" k = 2 Output : 72 Its tree representation is shown below Elements at level k = 2 are 6, 4, 1, 3 sum of the digits of these elements = 6 * 4 * 1 * 3 = 72 Input : tree = "(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))" k = 3 Output : 15 Elements at level k = 3 are 5, 1 and 3 sum of digits of these elements = 5 * 1 * 3 = 15
1. Input 'tree' in string format and level k 2. Initialize level = -1 and product = 1 3. for each character 'ch' in 'tree' 3.1 if ch == '(' then --> level++ 3.2 else if ch == ')' then --> level-- 3.3 else if level == k then product = product * (ch-'0') 4. Print product
Time Complexity: O(n)
- Sum of nodes at k-th level in a tree represented as string
- Difference between sums of odd level and even level nodes of a Binary Tree
- Level with maximum number of nodes using DFS in a N-ary tree
- Swap Nodes in Binary tree of every k'th level
- Count the number of nodes at given level in a tree using BFS.
- Find maximum level product in Binary Tree
- Print nodes between two given level numbers of a binary tree
- Count nodes with two children at level L in a Binary Tree
- Print extreme nodes of each level of Binary Tree in alternate order
- Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
- Print even positioned nodes of even levels in level order of the given binary tree
- Recursive Program to Print extreme nodes of each level of Binary Tree in alternate order
- Product of all nodes in a Binary Tree
- Product of all leaf nodes of binary tree
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.