This years DLPD exam had the following question
Given a binary tree and the following traversal information
In-Order : B P D Q K A C L T E F
Pre-Order: A K B D P Q L C F T E
construct the original tree.
Its an interesting problem, can you find the solution and back it up with logic - the problem solving approach you followed?
Subscribe to:
Post Comments (Atom)
Ranking and Unranking permutations
I've been a big fan of Skiena's Algorithm Design Manual , I recently found my first edition of the book (although I own the third ed...
-
(Photo from http://content-usa.cricinfo.com/indvaus2008/content/current/player/28114.html) Dravid's dismal form continues in test crick...
-
I've been reading up on Fast Fourier Transform (FFT) from several books on algorithms that I have, TCLR, Tamassia, Sahni, Numerical Rec...
-
The book is almost out there . There is code and selected solutions as well. The book is supposed to be in full colour from what I heard....
No comments:
Post a Comment