Lowest Common Ancestor of a Binary Search Tree | Leetcode 235 | Day 18 of 30 Days DSA Challenge

Поделиться
HTML-код
  • Опубликовано: 14 янв 2025

Комментарии • 6

  • @canzova
    @canzova  19 дней назад +2

    If you found this video helpful, don't forget to like it! Also, share your 30 days DSA journey on LinkedIn and tag me-I’d love to see your progress!

  • @Aditya-r9l2n
    @Aditya-r9l2n 19 дней назад +1

    Day 18 ✅

  • @IkshaSingh-k5t
    @IkshaSingh-k5t 19 дней назад

    The way you have used the property of BST, was really mind blowing 👌

    • @canzova
      @canzova  19 дней назад

      Thank You !!!

  • @sourav3798
    @sourav3798 19 дней назад

    Can't we solve it using the approch of finding LCA in a Binary Tree ?? 🌴

    • @canzova
      @canzova  19 дней назад

      Yes! It's possible to adapt the binary tree LCA approach for a binary search tree.