|
|
|
|
|
|
by 908B64B197
1745 days ago
|
|
|
> There are a few questions that people like to use as punching bags. Invert a binary tree. Reverse a linked list. Perform breadth-first and/or depth-first tree traversals. Anything to do with heaps. None of these are hard. Should be pretty much covered by any good algorithm class. |
|
|