The first step is to solve the base case, i.e., for the leaf nodes. The second step is to build the tree recursively. Like if you know the answer for the left and right subtree, deduce a formula to find the answer for their parent.
What is a tree in algorithm?
A tree is an hierarchical data structure consisting of various nodes that are connected to each other with edges. A tree originates from one node, which is called the root node. All the nodes (except the root ) have one parent but can have several children.
How to start studying Tree Interview Questions?
I would recommend taking a tree interview questions sheet and solving all the questions one by one. If you get stuck on any problem, check which topic the problem belongs to and give that topic a brief read.
What is the best way to answer Trees Interview Questions?
To answer a tree interview question, follow a two-step approach. First, solve the problem for all the leaf nodes. Secondly, build the tree recursively by figuring out the answer for the parent node given the answer for its left and right sub-tree.