Binary Search Tree

  1. Introduction to Binary Search Tree (BST).
  2. Tree Traversals.
  3. Insertion in Binary Search Tree (BST).
  4. Searching an Element in a Binary Search Tree(BST).
  5. Minimum value in a Binary Search Tree(BST).
  6. Deletion from Binary Search Tree(BST).
  7. Print Binary Search Tree(BST) keys in the given range.
  8. Check if given Binary Tree is BST or not.
  9. Find Kth smallest Element in a BST (Order Statistics).
    1. Find Kth largest Element in a BST (Order Statistics).
  10. Convert Sorted array to balanced Binary Search Tree (BST).
  11. Add all greater values to each node in a Binary Search Tree (BST).
    1. Convert Binary Search Tree (BST) to Greater Sum Tree.
    2. Create a BST such  that sum of all greater keys is added to its every key.
  12. Lowest Common Ancestor in a Binary Search Tree (BST).
  13. Inorder Successor and Predecessor of a given key in Binary Search Tree (BST).
    1. Inorder Successor in Binary Search Tree(BST).
  14. Remove Binary Search Tree (BST) keys outside a given range.
  15. Print inorder traversal of a Binary Search Tree (BST) represented using array.
  16. Check identical Binary Search Tree (BST).
  17. Check internal node of Binary Search Tree (BST) for exactly one child.
  18. Merge two Binary Search Trees(BST) with minimum extra space.
  19. Triplets in a Binary Search Tree(BST) that sum to zero.
  20. Fix Binary Search Tree(BST) with 2 swapped nodes.
  21. Create Binary Search Tree (BST) from preorder traversal.
  22. Floor and Ceil in a Binary Search Tree(BST).
  23. Why choose heaps over BST to implement priority queue?
  24. Second largest element in Binary Search Tree(BST).
  25. Print common nodes in two Binary Search Trees(BST).
  26. Sorted Linked List to balanced Binary Search Tree(BST).
  27. Remove duplicates in a Binary Search Tree(BST).
  28. Binary Search Trees from keys 1 to n.