01 - How to Use Nested Sets for Hierarchical Tree Representation (Introduction)

Поделиться
HTML-код
  • Опубликовано: 25 июл 2024
  • Buy me a coffee if this is useful 😀
    www.buymeacoffee.com/rowadz
    In this video, I'm giving an introduction to the nested sets tree approach to modeling tree-like data.
    code:
    github.com/Rowadz/nested-sets...
    🐦 Nested sets playlist 🐦:
    • 🐉 Nested Sets Trees 🐉
    Graphs and trees playlist:
    • 🔱 Graphs & trees 🔱
    00:00 Introduction and rules
    01:38 Example
    03:58 Slightly complex example
    06:36 Complex example
    08:54 End notes
  • НаукаНаука

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

  • @johnnyokito6356
    @johnnyokito6356 28 дней назад

    Good job! Concept very well explained!

  • @teerthraj7311
    @teerthraj7311 2 месяца назад

    thanks
    I was working on multi level marketing node-mysql project.
    there are 30 levels of user , with each user having a sponser user
    initiall yi was trying path enumeration method . but the path becomes too large and indexing on it 💥
    thanks for this it will definitely solve my problem
    finding all decendands and parent is fast but i guess insertion of new node will require multiple updation on table
    still its better since users dont register frequentyl

  • @devAliHH
    @devAliHH Год назад +1

    Wow this is brilliant, we’ve been talking about this problem for a week with principles, your solution is just perfect !

    • @Rowadz
      @Rowadz  Год назад

      Thank you Ali :3

  • @jim.....
    @jim..... 11 месяцев назад

    Thanks needed a visual explanation of the idea, this helped a lot!

  • @eziosan7208
    @eziosan7208 7 месяцев назад

    I was developing a binary Mlm app for a client, been stuck. Thank you.

  • @user-tw8fd5wt1g
    @user-tw8fd5wt1g Год назад

    How to add a new node into the set, and update existing values

    • @Rowadz
      @Rowadz  Год назад

      Check out the next videos in the playlist

    • @Rowadz
      @Rowadz  Год назад

      ruclips.net/p/PLM0LBHjz37LUgOrslWOJ2RcIJvWtxKIIz