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
log(30)
ReplyDeleteyes correct divya
ReplyDeletePLZ explain how ????
ReplyDeleteIn the month of january you have 30 days and you have to find one specific day.
ReplyDelete1)first you can ask him whether his birthday is in first 15 day.
if yes then you have to search again by breaking the problem in to two subsets.so this is kind of binary search technique.
hope things are clear now.if not please leave you comment.