Traversing Two BSTs

1 Apr 2009

Eric Roberts proposed an interesting problem today. The goal is to traverse the union of two BST’s. Since the solution is not too hard to come up with, he added the constraint that it has to be purely recursive. Pretty neat problem if you ask me. The solution is not that bad as well. I’m not actually sure if mine works. It’s too late for me to actually code it up, but I’ll post it when I do actually try it :).

Posted by Edward Luong on Wednesday, April 1, 2009 at 2:01 AM | 0 TrackBacks

Filed in ,

Recent Entries

  • Working Set

    I've got a small memory footprint. Every year, I've had to pack my things up to move out of my student housing, only to find...

  • Context Switch

    I have one last project to finish before I'm all done with school. I think I've been in more than enough effort to make the...

  • Growing up

    I'm on the verge of graduating. In fact, I took my last final which I'm 100% sure I did well enough on the pass that...

  • Homerun Pie

    When I was younger, I used to love eating Homerun Pie. They don't seem to make it, but most supermarkets tend to have some fruit...

  • Checklist

    Whenever I feel like I need to buckle down and get work done, I make a checklist. Here is my list for tonight: * Re-write...

Close