Coding Interview Questions

Problem Statement: You are given a binary tree, you need to print the extreme nodes in alternate order. Example: Input: Output: 7 6 Solution…

Problem Statement: Given a binary tree, you need to connect the nodes. Each nodes will have a next pointer, set these pointers to the next…

Problem Statement: Given a binary tree, perform level order traversal. Example: Input: /* * 10 * / \ * 8 12 * / \ / \ * 2 9 11 14 */ Output:…

Problem Statement: Convert a BST into Max Heap. Max Heap property: All the values in the left sub tree of a node should be less than the value…

Problem Statement: You are given a BST and a target, you need to find if such pair exist in the tree. Example: Input: target: 26 /* * 10 * / \…

Problem Statement: Convert a BST into Min Heap. Min Heap property: All the values in the left sub tree of a node should be less than the value…

Problem Statement: Given a binary tree, perform reverse level order traversal from bottom up and from left to right Example: Input: /* * 10 *…

Problem Statement: Given a binary tree, find the maximum path. Path does not need to pass through the root. A path can include each node at…

Problem Statement: You are given a binary tree, you need to check if it is a perfect binary tree or not. A binary tree is considered as…

Problem Statement: You are given a tree and a value k. You need to delete all the leaf nodes with the given value Example: Input: /* * 10 * /…