| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2019-01-08 | Tree height non-recursive version done! | Haidong Ji | |
| Yay!!! I got rid of the recursion and used an iterative function to calculate height. The trick used was to use a queue. It turned out to be faster and consumed less memory. Fun stuff and I'm happy :) | |||
| 2019-01-07 | Tree height recursive version done! | Haidong Ji | |
| Following example starter code, I had to specify stackSize when creating the thread. Without it, it won't pass tests due to stack overflow error. I'll still try to work out an iterative version using Queue. We'll see. | |||
 |
index : DataStructureFundamentalJava | |
| UCSD Data Structures Fundamentals exercises done in Java https://www.edx.org/course/data-structures-fundamentals-uc-san-diegox-algs201x |
| summaryrefslogtreecommitdiff |