Re: [algogeeks] Re: How to save a binary search tree space efficiently

2011-08-30 Thread Vidit Sinha
whats the final answer guys? Level order traversal?? On Tue, Aug 30, 2011 at 12:56 AM, Don dondod...@gmail.com wrote: I'm not sure if this is what you are looking for, but I once came up with a way to save a binary tree in such a way that when it is rebuilt, it will be balanced. You don't get

Re: [algogeeks] Algorithms for Interviews _scan ocr_.pdf

2011-08-13 Thread Vidit Sinha
The link doesnt seem to work. Can somebody mail it again? On Sat, Aug 13, 2011 at 10:22 PM, Yasir yasir@gmail.com wrote: Kudos to Aditi. :D -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To view this discussion on the web visit

Re: [algogeeks] Design .. how to attack ???

2011-08-12 Thread Vidit Sinha
As far as a Design Question like this is concerned: 1) Design a base class car class Car { String model; String make; String carSegment; // SUV, MUV, Sedans, Hatchbacks etc String seats; boolean bookingStatus; // Booked or not ... public assignToCustomer (String custID) {...} } 2) Design a