Insertion in Binary Search Tree (BST) using RECURSIVE FUNCTION (Working with Diagram) | DSA

Поділитися
Вставка
  • Опубліковано 9 лис 2024

КОМЕНТАРІ • 29

  • @greenoceantech5609
    @greenoceantech5609 3 роки тому +6

    Bro you are better than my personal paid teacher....... I think you need to be an professor....... I can't believe your teaching those things for free.... Hats off

    • @SimpleSnippets
      @SimpleSnippets  3 роки тому +9

      Wow, thanks. Glad to hear this from you. And yes I am trying my best to teach all these fundamental subjects for free because I feel everyone should get access to such knowledge for free.

  • @preetishamballi6988
    @preetishamballi6988 3 роки тому +6

    Hello Tanmay,
    appreciate your efforts on creating this playlist.
    request you to look into memory leak of the complete program of binary search tree.
    You have kept it real simple to understand but at the same time keeping it correct matters as this is C++.

  • @ramizzaheer7238
    @ramizzaheer7238 3 роки тому +7

    Your videos are a life saver, i'm really hoping for videos related to graph, Btree and complete Avl tree as it's in my course :(

  • @fatossm
    @fatossm Місяць тому

    harika anlatıyorsunuz, çok teşekkürler. Türkiye'den Selamlar!

  • @MistrYouTuber
    @MistrYouTuber 3 роки тому +4

    Bro...my DSA course is totally based on u...i have cleared most of topics from u...
    Plz increase your upload speed otherwise i will not get good gpa 😥

  • @sakurapandu8860
    @sakurapandu8860 2 роки тому +1

    Thank you, this video cleared alot of things

  • @abhimanyu6534
    @abhimanyu6534 3 роки тому +2

    Plzz complete this course as soon as possible 🙏🙏🙏🙏🙏🙏🙏🙏🙏

  • @flowing_dance
    @flowing_dance 2 роки тому +1

    Excellent Explanation!

  • @nileshtoshniwal9046
    @nileshtoshniwal9046 3 роки тому +3

    Please cover them as soon as possible pls 😍😍

  • @vijayalaxmiise1504
    @vijayalaxmiise1504 2 роки тому

    Thank You sir

  • @shaharrefaelshoshany9442
    @shaharrefaelshoshany9442 3 роки тому +1

    best ever

  • @nileshtoshniwal9046
    @nileshtoshniwal9046 3 роки тому +2

    Sir when you are going to upload next vedio? 🙏🙏
    We are hardly waiting for the Red black trees vedio 🙈🙈

  • @cpwithsundar
    @cpwithsundar 3 роки тому +2

    Sir, Great video.
    May I know whether are you still studying or where do you work sir?

  • @aniketdhiman
    @aniketdhiman 3 роки тому +3

    Waiting.....

  • @DebashisDGiri
    @DebashisDGiri 3 роки тому +2

    Sir how many more videos to come in this playlist??

  • @AiminglowNAccpble
    @AiminglowNAccpble 3 роки тому +4

    Any idea sir how long it will go?

    • @SimpleSnippets
      @SimpleSnippets  3 роки тому +4

      Nope this seems like a never ending subject to me 😅

  • @devmahad
    @devmahad Рік тому

    18:23 (For my notes)

  • @gauravjaiswal7407
    @gauravjaiswal7407 3 роки тому +1

    WOW!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

  • @praveens7698
    @praveens7698 3 роки тому +2

    Good concept sir
    But too slow of uploading videos.People can't wait they will watch on another channel.Just suggestion

    • @SimpleSnippets
      @SimpleSnippets  3 роки тому +4

      Thanks Praveen. Actually I myself encourage people to not wait on my videos and watch other channels and sources. Because these videos take a lot of time to make and unfortunately I cannot do much about it as I handle the entire process alone. 😇

  • @gamsterilyass2952
    @gamsterilyass2952 Місяць тому

    the goat

  • @nizarmejri9478
    @nizarmejri9478 3 роки тому

    Respect

  • @susmitsingh1775
    @susmitsingh1775 3 роки тому +1

    //I came up with a similar implementation
    Node* insert_rec (Node* root , Node *n)
    {
    if (root == NULL) return root;
    else if (root->data > n->data && root->left == NULL) return root;
    else if (root->data < n->data && root->right == NULL) return root;
    else if (root->data > n->data && root->left != NULL) insert_rec (root->left , n);
    else insert_rec (root->right , n);
    }
    //if NULL is returned manually assign the tree root to new_node

  • @fazilabano1309
    @fazilabano1309 3 роки тому +1

    😇👍