CST370 Week 5
- Get link
- X
- Other Apps
Hello everyone,
This week we studied binary‑tree traversals preorder, inorder, and postorder but I kept mixing them up. I finally got it when I attended TA office hours, and it clicked. Walking through Quick Sort step by step helped me see how the Decrease and Conquer approach works by breaking problems into smaller chunks. Then we looked at Kahn’s algorithm, and watching it remove nodes with no incoming edges reminded me of picking a pivot in Quick Sort. Seeing these patterns repeat helped me realize that many algorithms work by simplifying things piece by piece.
- Get link
- X
- Other Apps
Comments
Post a Comment