This is a Binary-Search Tree template written by Leon.
This problem can be solved by at least 4 methods:
- Quick Sort
- Binary Search Tree
- Trie and Depth First Search
Here is my pseudo code:
1 2 3 4 5 6 7
When VC6.0 breaks down due to a stack overflow, sometimes you can adjust the stack allocations to get around this problem.
Write the bytes you need in Stack allocations->Reserve.