archgaelix
  • Uses
  • Archive
  • DSA
  • Uses
  • Archive
  • DSA

Find a value in a BST

July 20, 2021
#bst 
Read more →

Deletion of a node in a BST

#bst 
Read more →

Find min and max value in a BST

July 20, 2021
#bst 
Read more →

Find inorder successor and inorder predecessor in a BST

#bst 
Read more →

Check if a tree is a BST

July 20, 2021
#bst 
Read more →

Populate inorder successor of all nodes

#bst 
Read more →

Find LCA in a BST

July 18, 2021
#bst 
Read more →

Construct BST from preorder traversal

#bst 
Read more →

Convert binary tree into BST

#bst 
Read more →

Convert a normal BST into a balanced BST

#bst 
Read more →

Merge two BST

#bst 
Read more →

Find Kth largest element in a BST

#bst 
Read more →

Find Kth smallest element in a BST

#bst 
Read more →

Count pairs from 2 BST whose sum is equal to given value X

#bst 
Read more →

Find the median of BST in O(n) time and O(1) space

#bst 
Read more →

Count BST nodes that lie in a given range

#bst 
Read more →

Replace every element with the least greater element on its right

#bst 
Read more →

Given N appointments, find the conflicting appointments

#bst 
Read more →

Check preorder is valid

#bst 
Read more →

Check whether BST contains dead end

#bst 
Read more →

Largest BST in a binary tree

#bst 
Read more →

Flatten BST to sorted list

#bst 
Read more →
Older posts →
archgaelix
© 2021 Seshal Jain Powered by Hugo