Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
create a list with numbers lesser than the specified number, and this should be sorted list. Now start from left of this list and move until (list item value <= (given no/2)). Create 2 pairs, 3 pairs and so on.
ReplyDeletefor ex : here list will be {2->3->6}
first for 2 pairs: take 2 .. sum now needed = 7 - 2 = 5
search 5 in list if found then {2,5} was an answer
otherwise go on. now 2 pair is not possible with 3 also.
3 pairs. start with 2 two's and find (7 - 2*2)= 3. match found. Answer= {2,2,3}