Publication Tech Interview YouTube Say Hello

Binary Tree

A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

Binary Tree

Tree questions are very common at top tech company interviews.

Binary tree has an elegant recursive structure - Assuming you knew the solution to the left subtree and the right subtree, how could you combine the two results to give you the final solution?

Understanding the tree properties, structure, implementation and tree traversals are important for solving problems in the tree.
Identify patterns among problems: We can apply the idea of tree traversal for the solution of several problem in binary tree.
Identifying the base case: This usually means solving the leaf node case (a leaf node has no left or right children) or the null case.
Common operations: Insertion, Deletion, Searching, Traversal, Finding Internal Nodes, Finding leaf nodes, Finding height etc.

Concepts and Problems - Binary Tree

#	Title	Difficulty	Companies
1.	Non-Linear Data Structure
2.	Tree Introduction and Structure
3.	Binary Tree Properties and Types
4.	Binary Tree Representation : Linked and Sequential Representation
5.	Tree Traversals : Inorder, Pre-Order, Post-order and Level Order Traversal
6.	Preorder, In-order and Post traversal using stack
7.	Basic Tree Operations : Search, Insert, Delete, Max/Min
8.	Example 1 : Find height of a binary tree	EASY	Amazon Goldman Sachs
9.	Example 2 : Average of Levels in Binary Tree	EASY
10.	Example 3 : Sum of Left Leaves	EASY	Facebook
11.	Example 4 : Construct BT from preorder and In-order Traversal	MEDIUM	Amazon Google
12.	Example 5 : Check two binary tree are identical or not	EASY	Amazon
13.	Example 6 : Check if a binary tree is height-balanced?	EASY	Amazon Goldman Sachs
14.	Applications of Tree Data Structure