Become Master in Tree
A LeetCode study guide that starts with tree terminology and types of binary trees, then teaches preorder, inorder and postorder traversal both recursively and iteratively through a sequence of problems ordered easy to hard. The explanations are visual and the code is in Java. Useful when tree traversal still feels like memorisation rather than something you can reason about.
Guide
Interview Prep
hi-malik (LeetCode)
Beginner
Free
A LeetCode study guide that starts with tree terminology and types of binary trees, then teaches preorder, inorder and postorder traversal both recursively and iteratively through a sequence of problems ordered easy to hard. The explanations are visual and the code is in Java. Useful when tree traversal still feels like memorisation rather than something you can reason about.
Ready to start?
Opens on hi-malik (LeetCode) in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Sessions are free for approved Sefism members, and a few slots open each week.
Follow along
New writing, resources and project ideas land here first.