## Amazon Interview Experience

Round: I An Array arr={7, 7, 8, 8, 9, 1, 1, 4, 2, 2} has numbers appearing twice or once. Duplicates appear side by side… Read More »

- Count the Number of Binary Search Trees present in a Binary Tree
- Two nodes of a BST are swapped, correct the BST | Set-2
- Total number of possible Binary Search Trees using Catalan Number
- Merge two BSTs with constant extra space
- Find the node with maximum value in a Binary Search Tree using recursion
- Applications of BST
- Sum of all the levels in a Binary Search Tree
- Pair with a given sum in BST | Set 2
- Lexicographically Smallest Topological Ordering
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- Find the node with minimum value in a Binary Search Tree using recursion
- Generate two BSTs from the given array such that maximum height among them is minimum
- Number of pairs with a given sum in a Binary Search Tree
- Print Binary Search Tree in Min Max Fashion
- Implementing Forward Iterator in BST
- Number of edges in mirror image of Complete binary tree
- Nodes from given two BSTs with sum equal to X
- Triplet with a given sum in BST | Set 2
- Pair with minimum absolute difference | BST
- Flatten BST to sorted list | Increasing order
- Implementing Backward Iterator in BST
- Implementing a BST where every node stores the maximum number of nodes in the path till any leaf
- Find the minimum absolute difference in two different BST's
- Flatten BST to sorted list | Decreasing order
- Pre-Order Successor of all nodes in Binary Search Tree

Round: I An Array arr={7, 7, 8, 8, 9, 1, 1, 4, 2, 2} has numbers appearing twice or once. Duplicates appear side by side… Read More »

Round 1: Round 1 was for 200 marks. 25 MCQs and 2 coding questions .The MCQs were mostly on aptitude and some were Technical (C++… Read More »

There were a total of 3 rounds. 1st was online coding, 2nd was written coding and last round was divided in three parts, basically 3… Read More »

Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of… Read More »

Given an array representing preorder traversal of BST, print its postorder traversal. Examples: Input : 40 30 35 80 100 Output : 35 30 100… Read More »

Given a binary search tree and a target node K. The task is to find the node with the minimum absolute difference with given target… Read More »

Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greater… Read More »

Given a BST, the task is to find the sum of all elements greater than and equal to kth largest element. Examples: Input : K… Read More »

Given a Binary Search Tree which is also a Complete Binary Tree. The problem is to convert a given BST into a Special Max Heap… Read More »

Self-Balancing Binary Search Trees are height-balanced binary search trees that automatically keeps height as small as possible when insertion and deletion operations are performed on… Read More »

Pre-requisite : set in C++, unordered_set in C++ Differences : | set | unordered_set ——————————————————— Ordering | increasing order | no ordering | (by default)… Read More »

In this post we will compare Red Black Tree and AVL Tree. Red Black Tree: Properties: Self-Balancing is provided by painting each node with one… Read More »

Given two values n1 and n2 (where n1 < n2) and a root pointer to a Binary Search Tree. Print all the keys of tree… Read More »

Given a Binary Search Tree(BST), convert it to a Binary Tree such that every key of the original BST is changed to key plus sum… Read More »

Given a binary search tree and a key, your task to reverse path of the binary tree. Prerequisite : Reverse path of Binary tree Examples… Read More »