Here is a curated list of top interview problems on binary trees. These are mostly asked in face to face technical interview rounds. The list

# Author: Raunak Jain

SDE at Societe Generale | Ex-Intern at Samsung R&D Institute | Ex-Intern at Hewlett Packard Enterprises

## Check if a binary tree is a subtree of another binary tree

You are given the root nodes of two trees T and S, you need to check whether S is a subtree of T or not.

## Construct a BST from preorder traversal

You are given a preorder traversal, you need to construct a binary search tree. Input: {10, 5, 1, 7, 40, 50} is the preorder traversal.

## Left view of a binary tree

You are given a binary tree, you need to print the left view of it. Consider the tree in the below figure. The left view

## Construct a binary tree from preorder and postorder traversals

You are given preorder and postorder traversals, you need to construct the binary tree. Input: Preorder = {1, 2, 4, 8, 9, 5, 3, 6,

## Construct a binary tree from inorder and preorder traversals.

You are given inorder and preorder traversals, you need to construct the binary tree. Input: Inorder = {4, 2, 5, 1, 3, 6} Preorder =