veeru sagar wrote: > Can any bosd give the programm of datastructure > like > 1)linked list > 2)infix to postfix > 3)binary tree >
The C++ STL has examples of 1 and 3. Most compilers should provide source code for the standard libraries, if not, try looking at gcc because I know it does. You can look at the std::list which is generally implemented as a linked list, and std::map is generally some form of a binary tree (e.g. red/black, which is just a binary tree with additional constraints). If, after examining source code that is tested and proven to be correct you still have questions, then please ask. You will receive a better response if you take the time to pick apart the code and say, for example, "why do the node pointers in this linked list exhibit this behavior XYZ?" rather than "how does a linked list work?" when you have source code (and probably a text book) in front of you. One of the textbooks I used in college was pretty good in terms of explaining data structures. After all these years I still have the book on my shelf, so I looked up the author, and here is a link to the C++ version of the book I used: http://www.brpreiss.com/books/opus4/ You may find code examples or explanations on that site that will help, you might not. Either way, there it is, you can look through it if you want. -- John Gaughan
