Fast Interview prep

Important questions on bst are posted on the website, now posting the binary tree questions.
Find below question on website.

Write a function that takes in a Binary Tree and returns a list of its branch sums ordered from leftmost branch sum to rightmost branch sum.

A branch sum is the sum of all values in a Binary Tree branch. A Binary Tree branch is a path of nodes in a tree that starts at the root node and ends at any leaf node. Each BinaryTree node has an integer value, a left child node, and a right child node. Children nodes can either be BinaryTree nodes themselves or None / null.

BRANCH SUMS This site contains paid content for free, data structures and algorithms, system design questions, project based queries, Fast preparation material.

Most Frequently asked interview topics in product based companies :
1. Binary tree
2. Arrays
3. Dynamic Programming
4. Graph

Percent of questions asked varies from company to company.
But if you want to excel interviews then the best way is get hold over recursion.
If you are well versed with recursion you can easily solve above topics.

Have a look on below link to quickly prepare for interviews.

Fast Interview Preparation DSA, System Design, Python