Skip to content

Tag Archives: BST

Given N elements to be inserted into Binary Search Tree. The task is to construct a binary search tree with only insert operation and finally… Read More
Given N, Find the total number of unique BSTs that can be made using values from 1 to N. Examples:   Input: n = 3 Output: 5… 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 (BST), convert it to a Binary Tree such that every key of the original BST is changed to key plus sum of all greater keys in BST

Start Your Coding Journey Now!