Typical Workload
Moderate11.6hrs/week
Difficulty
Hard7.6/ 10
Would take again
Most would77%
Averages from 31 student ratings. Student opinions, not an OfCourse rating. Rate this course
Georgia Tech30 Verified Students30 posts
Lists, trees, heaps, hashing, sorting and graph algorithms, plus the Big-O analysis behind them.
Workload: about 12 to 15 hours a week, more during the tree unit. What went well: the course builds steadily. Once linked lists and recursion made sense, trees felt like a natural next step, and graphs built on both. What was hard: the coding assignments have a lot of edge cases, and it's easy to underestimate them. I…
Radiant · 18 lit, 0 off
2 posts in Trees · Clear filters
I bought a cheap whiteboard and it was the best purchase of the semester. Before writing any tree or graph code, I draw the structure, then walk through the operation step by step with a marker. Why it helps: bugs in pointer-heavy code are almost always "I upd…
Zero and one child make sense to me. The two-children case is where I get lost. Why is replacing with the successor (or predecessor) always safe? And how do you all keep straight which one to use?