avatar_url

Sandesh Rana | Python

I'm a developer from Himalayas, with a passion for crafting efficient and elegant code, with creativity and precision.
Navigation Home About Me Projects XML Feed

Binary Search Tree

20 Aug 2024 » programming, datastructure, tree
1. Binary Search Trees (BST): Easy to Hard Problems
 - Easy
 - Medium
 - Hard

Binary Search Trees (BST): Easy to Hard Problems

Easy

  1. Validate Binary Search Tree
  2. Lowest Common Ancestor of a Binary Search Tree
  3. Convert Sorted Array to Binary Search Tree
  4. Trim a Binary Search Tree
  5. Range Sum of BST
  6. Search in a Binary Search Tree
  7. Insert into a Binary Search Tree

Medium

  1. Kth Smallest Element in a BST
  2. Delete Node in a BST
  3. Inorder Successor in BST
  4. Convert BST to Greater Tree
  5. Construct Binary Search Tree from Preorder Traversal
  6. All Elements in Two Binary Search Trees
  7. Balance a Binary Search Tree
  8. Binary Search Tree Iterator

Hard

  1. Recover Binary Search Tree
  2. Serialize and Deserialize BST
  3. Closest Binary Search Tree Value II
  4. Largest BST Subtree
  5. Smallest Rectangle Enclosing Black Pixels
  6. Design and Implement a Data Structure for a Persistent BST
  7. Maximum Sum BST in Binary Tree
  8. Binary Search Tree to Greater Sum Tree

Related Posts