Showing Posts From

Traversal

• 20 Oct, 2025
• • Trees

N-ary Trees: Traversal & Encoding

Week 13 notes: once a node can have any number of children, the binary-tree patterns still work, you just loop over children. Plus encoding an N-ary tree as a binary one.

• 29 Sep, 2025
• • Trees

Binary Trees: Traversals & DFS / BFS

Week 10 notes: binary trees are basically recursion you can draw. The three DFS orders, level-order BFS, and the one move that solves most tree problems.