[Amazon]construct tree with preorder traversal
Leaves are represented with L and non-leaf with N in a tree. Each node has either 0 or 2 children. so if given preorder traversal of this tree, construct the tree.
[AMAZON] Vertical sum of nodes
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
but the tree wont be unique...we can have many such trees...pls elaborate..
ReplyDelete@Anonymous no since each node in the tree has either 0 or 2 nodes ,so preorder traversal will always be unique..please check this taking some example ..:)
ReplyDeleteeg.
ReplyDeleteconsider the preorder 1 2 4 5 6 7 3
Tree 1:
2,3 are child of 1
4,7 are child of 2
5,6 are child of 4
Tree 2:
2,3 are child of 1
4,5 are child of 2
6,7 are child of 5
@Anonymous in your example 5 is leaf node in tree 1 so it will be representd in above tree as L and in second tree it is non leaf so it will be represented as N(Non-leaf).so they are not same..:)
ReplyDelete