DevLift

Blog

Tutorials, guides, and insights to help you become a better developer.

Clear
LC 297 is a Hard but the insight is simple: null markers make any traversal unambiguous. Learn preorder DFS and BFS serialization, plus the BST shortcut for LC 449.
AdminAugust 2, 20268 min read
Post-order DFS, the global-state side-effect trick, and nested tree matching — four problems that teach you everything about recursive tree traversal in JavaScript.
AdminAugust 2, 20266 min read
One BFS template, three interview problems. Level-order, zigzag traversal, and right side view all reduce to the same queue loop with a small variation each time.
AdminAugust 2, 20265 min read

Stay in the Loop

Get notified about new courses, tutorials, and learning tips. No spam, unsubscribe anytime.