## Total number of possible Binary Search Trees using Catalan Number

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

- Median of sliding window in an array
- Split a BST into two balanced BSTs based on a value K
- Print all pairs from two BSTs whose sum is greater than the given value
- Total number of BSTs using array elements
- Largest element smaller than current element on left for every element in Array
- Duplicates Removal in Array using BST
- Construct BST from given preorder traversal | Set 3 (Naive Method)
- Maximum product of bitonic subsequence of size 3
- Create Balanced Binary Tree using its Leaf Nodes without using extra space
- Convert a Binary Search Tree into a Skewed tree in increasing or decreasing order
- Binary Search Tree | Set 3 (Iterative Delete)

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

Given a Binary Search Tree, the task is to find the node with maximum value. Examples: Input: Output: 22 Recommended: Please try your approach on… Read More »

Given a Binary Search Tree with two of the nodes of the Binary Search Tree (BST) swapped. The task is to fix (or correct) the… Read More »

Given a Binary Search Tree, the task is to find the node with minimum value. Examples: Input: Output: 4 Recommended: Please try your approach on… Read More »

Given two Binary Search Trees(BST), print the elements of both BSTs in sorted form. Note: Both the BSTs will not have any common element. Examples:… Read More »

Given a Binary Search Tree, the task is to find the horizontal sum of the nodes that are in the same level. Examples: Input: Output:… Read More »

Given an array of n integers, the task is to make two Binary Search Tree from the given array (in any order) such that the… Read More »

Given a complete binary tree of depth H. If the mirror image from the left and the right side of this tree is taken then:… Read More »

Binary Search Tree, is a node-based binary tree data structure which has the following properties: The left subtree of a node contains only nodes with… Read More »

Given a binary tree, the task is to print the maximum sum of nodes of a sub-tree which is also a Binary Search Tree. Examples:… Read More »

Given a binary tree, the task is to count the number of Binary Search Trees present in it. Examples: Input: 1 / \ 2 3… Read More »

Given N boxes with their capacities which denotes the total number of boxes that it can hold above it. You can stack up the boxes… Read More »

Given an array arr[] of size N. The task is to find whether it is possible to make Binary Search Tree with the given array… Read More »

The whole process was online. All the interviews were help via HackerRank CodePair Platform in our TPC office since they did not visit the campus.… Read More »

I applied for SSE position (Gurgaon Location) There were three rounds.. First round: Data Structures And Problem solving Level order traversal in spiral form Rotate… Read More »