Uses
Archive

bst

Lowest Common Ancestor of a Binary Search Tree
#bst #easy
Validate Binary Search Tree
#bst #medium
Kth Smallest Element in a BST
#bst #medium
Find a value in a BST
#bst
Find min and max value in a BST
#bst
Find inorder successor and inorder predecessor in a BST
#bst
Deletion of a node in a BST
#bst
Check if a tree is a BST
#bst
Populate inorder successor of all nodes
#bst
Find LCA in a BST
#bst
Construct BST from preorder traversal
#bst
Convert binary tree into BST
#bst
Convert a normal BST into a balanced BST
#bst
Merge two BST
#bst
Find Kth largest element in a BST
#bst
Find Kth smallest element in a BST
#bst
Count pairs from 2 BST whose sum is equal to given value X
#bst
Find the median of BST in O(n) time and O(1) space
#bst
Count BST nodes that lie in a given range
#bst
Replace every element with the least greater element on its right
#bst
Given N appointments, find the conflicting appointments
#bst
Check preorder is valid
#bst
Check whether BST contains dead end
#bst
Largest BST in a binary tree
#bst
Flatten BST to sorted list
#bst