Member-only story
#OneYearCodingPlan: Trees and Tries
In this article, we’ll discuss Trees and Tries for coding interviews. Trees are fairly easy to master and one of the most frequently asked about topics. Understanding trees is also important to understand and solve graph questions later, because if you find trees hard, chances are you’ll find graphs much harder.
Source — FreeCodeCamp
Timeline:
Understanding structure of a node, learning how to build your own tree class , and learning the different types of trees(theory)— 1 day
Mastering traversals — 1 week
Mastering tree building and Tries — 1 week
Easy and Medium questions— 1 week
Hard questions — 1 week.
Understanding trees:
Here are the steps you should follow:
- Understand the terminology of different components of a tree (Node, root, subtree etc)
- Learn how to write your own tree class.
Study the following different type of trees, these also make great techical questions during phone interviews (1st rounds) for several companies.
- Binary tree and N-ary tree
- Balanced tree
- Binary Search Tree
- Complete vs Full vs Perfect Tree
- AVL Trees
- Red-Black Trees
Here’s a great tutorial in Java — EducativeIO
These should be useful for Cpp—Tutorials Spot and HackerEarth
Python — Tutorials Spot
Mastering Traversals:
These problems are the heart of all tree problems, if you thoroughly understand these, you’ll be able to solve majority of questions.
Inorder traversal —Solve this both recursively and Iteratively. If this is your first time understanding trees, feel free to check the solution directly.
Preorder and Postorder — Solve these on your own.
