Skip to content
Avio Lines
D15

Binary Search Trees

5 stations · 1.5h

BST properties, validation, insertion and deletion. 5 interview problems explained by codestorywithMIK (1.5h of video), grouped into 3 patterns such as Inorder = Sorted, Construction & Balancing, Range Queries.

Start this line →
problems by zone (pattern)
  • Inorder = Sorted3
  • Construction & Balancing1
  • Range Queries1

  1. Inorder = Sorted

    0 of 3 passed
  2. Minimum Absolute Difference in BSTLC 530 · 18:02
    EasyGoogle · Amazon · +1 more companiesLeetCode ↗ (opens in a new tab)
  3. Find Mode in Binary Search TreeLC 501 · 17:57
    EasyGoogle · Amazon · +2 more companiesLeetCode ↗ (opens in a new tab)
  4. Binary Search Tree to Greater Sum TreeLC 1038 · 27:38
    MediumGoogle · Amazon · +1 more companiesLeetCode ↗ (opens in a new tab)

  5. Construction & Balancing

    0 of 1 passed
  6. Balance a Binary Search TreeLC 1382 · 14:11
    MediumGoogle · Amazon · +3 more companiesLeetCode ↗ (opens in a new tab)

  7. Range Queries

    0 of 1 passed
  8. Range Sum of BSTLC 938 · 14:30
    EasyGoogle · Amazon · +4 more companiesLeetCode ↗ (opens in a new tab)

All 5 stations in order

  1. 1.Range Sum of BST (LeetCode 938)
  2. 2.Minimum Absolute Difference in BST (LeetCode 530)
  3. 3.Find Mode in Binary Search Tree (LeetCode 501)
  4. 4.Binary Search Tree to Greater Sum Tree (LeetCode 1038)
  5. 5.Balance a Binary Search Tree (LeetCode 1382)