Given a Binary Search Tree (BST) and a positive integer k, find the k’th smallest element in the Binary Search Tree.
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 »
Given a Binary Search Tree (BST) and a range, count number of nodes that lie in the given range.
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 »
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 »
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 »
Hash Table supports following operations in Θ(1) time.
Given a Binary Search Tree (BST) and a positive integer k, find the k’th largest element in the Binary Search Tree.
Given n appointments, find all conflicting appointments.
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 »
I recently encountered with a question in an interview at e-commerce company. The interviewer asked the following question:
Given a BST, transform it into greater sum tree where each node contains sum of all nodes greater than that node.
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 »
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 »