The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote
                          /     \
                        5        7
                    /    \      /   \
                   6       4    1     3



Tree  given in the form: (node value(left subtree)(right subtree))
For tree given above: (0(5(6()())(4()(9()())))(7(1()())(3()())))
Input format: K Tree
Output format: Sum
For example, for given tree:
Input: 2 (0(5(6()())(4()(9()())))(7(1()())(3()())))
Output: 14


I just want to know the basic logic using push and pop operation of stack ,since I think it is easy to work with stack here 

asked in Programming by Boss (8.2k points) | 609 views
why u want to do it by push and pop?

Better to write a simple binary tree and if node exists for the tree call sum function
I am not getting any clue of how to check whether the given string is a tree or not ?
So basically it will be prefix evaluation rt?
that could be infix or postfix too. then add up all numbers. No need of parse tree for adding . rt?

1 Answer

+1 vote

This problem can be solved easily with recursion on the basis of parentheses count, Have a look at my code and explanation :
sum of all elements at Kth level from root of a tree, represented as string

answered by (21 points)

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,239 questions
40,932 answers
39,846 users