Banazîr the Jedi Hobbit (banazir) wrote,
Banazîr the Jedi Hobbit
banazir

  • Mood:
  • Music:

Data structures and algorithms: balanced search trees and mergeable heaps

Here are a few questions for computer science majors:
1. When did you first encounter balanced search trees and heaps for priority queues?
2. Which variations (red-black trees, heaps) did you cover?
3. Did you have you implement it from scratch?
4. If not, what did you do with existing code?
5. How many semesters total did you spend studying balanced search trees (among other topics)?

To be cross-posted to compscibooks

--
Banazir
Tags: algorithms, data structures
Subscribe
  • Post a new comment

    Error

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 2 comments