Hi, You can view this problem as parentValue -> actual value of parent childValue -> number of childs associated with it(which can be zero or 1)
so, (8,2) (4,1) (10,2) (2,0) (9,0) (12,0) is the BST. Thanks. On Wed, Oct 31, 2012 at 10:01 AM, Arun Kindra <[email protected]>wrote: > Ques - * > > struct node > { > int parentValue; > int childValue; > }str[10]; > > how to construct a BT,given an array of structure containing parent and > child value. > * > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- PRANKUR GUPTA Masters Student (CSE) State University of New York Stony Brook University [email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
