I just finished my first exam in in Sweden, Algorithms and Data Structures. It was about a two hour test, lots of heaps and BSTs and Ordos and graphs and stuff. I know I didn't get a hundred but I'm sure I did well.
One question: "Whats the max levels for a BST?" You would think log(n) but in the worst case it's n, but if it's n then it's not a BST (in theory). lol
