Hi everyone!

I recently finished 3 months of interviewing, and I received multiple offers! It was no walk in the park because my data-structures knowledge wasn't the best.

In particular, I was terrible at solving binary tree questions. So I practiced and practiced and practiced until I became confident I could solve almost any binary tree questions on LeetCode/HackerRank.

I want to prepare a guide that explains my process for solving these questions to help anyone struggling in this area or just want to refine their skills.

My question is, what would you expect from a complete guide on solving Binary Tree questions? My working outline so far is as follows:

Foundation
-Tree DS: class, insertion, deletion, array-based trees
-All Tree Traversals (recursive)
-All Tree Traversals (iterative)
-Tree specific Algorithms

How to Solve
-How to determine the type of question and solution (my guide)
-Common gotchas
-20+ Question Solution Explanations

Do you feel like something is missing? Please comment on any ideas you have or if you want to receive this guide when it releases!

I'll be working on this over the coming weeks and releasing it in pieces over twitter and devto. If you want to follow my process and get a behind the scenes look, follow me on Twitter!

Photo by Zane Lee on Unsplash