##
K’th smallest element in BST using O(1) Extra Space
July 16, 2015

Given a Binary Search Tree (BST) and a positive integer k, find the k’th smallest element in the Binary Search Tree.

July 16, 2015

Given a Binary Search Tree (BST) and a positive integer k, find the k’th smallest element in the Binary Search Tree.

July 4, 2015

Given a Binary Search Tree (BST) of integer values and a range [low, high], return count of nodes where all the nodes under that node… Read More »

July 2, 2015

Given a Binary Search Tree (BST) and a range, count number of nodes that lie in the given range.

June 17, 2015

Given a Binary Search Tree(BST), find the second largest element. Examples: Input: Root of below BST 10 / 5 Output: 5 Input: Root of below… Read More »

May 28, 2015

Design a data structure to do reservations of future jobs on a single machine under following constraints. 1) Every job requires exactly k time units… Read More »

May 11, 2015

In a Binary Search Tree (BST), all keys in left subtree of a key must be smaller and all keys in right subtree must be… Read More »

April 1, 2015

Hash Table supports following operations in Θ(1) time.

March 19, 2015

Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.

December 8, 2014

Given n appointments, find all conflicting appointments.

August 4, 2014

Following article is extension of article discussed here. In AVL tree insertion, we used rotation as a tool to do balancing after insertion caused imbalance.… Read More »

July 25, 2014

I recently encountered with a question in an interview at e-commerce company. The interviewer asked the following question:

June 27, 2014

Given a BST, transform it into greater sum tree where each node contains sum of all nodes greater than that node.

January 30, 2014

We have discussed BST search and insert operations. In this post, delete operation is discussed. When we delete a node, there possibilities arise.

The following is definition of Binary Search Tree(BST) according to Wikipedia Binary Search Tree, is a node-based binary tree data structure which has the following… Read More »

September 12, 2013

Given a Binary Search Tree (BST), modify it so that all greater values in the given BST are added to every node. For example, consider… Read More »