1. how we can store the word each seperated by space into array if we are considering binary tree??????? Ans: Each Node will Have an array of Some Const Size limited by Max Word length
2. how we can measure which is smaller than other according to property?????????? Ans Obviously strcmp(str1, str2) - standard library function / or u can implement yours 3. if we store each word into hash table then how we can get those words stored at different places in hash table??????? Ans: u have to define some function that takes string as input generates a key. and then use that key for hashing and for different keys your function should be good enough. 4. how we know about the indexes where we have store the word because in the end we have to combine all the wordinto string..... Ans: you can keep an extra array to store that for each word -- Sunny Aggrawal B.Tech. V year,CSI Indian Institute Of Technology,Roorkee -- 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.
