CIRCULAR LINKED LIST (DELETION FROM BEGINNING,ENDING AND SPECIFIED POSITION) - DATA STRUCTURES

Поділитися
Вставка
  • Опубліковано 31 січ 2025

КОМЕНТАРІ • 66

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

    its very easvy and too much easy explantion my final exams and your vedios too much help me thanks alot sir

  • @harshitha6160
    @harshitha6160 5 років тому +3

    Waiting for this video ,Thank you for uploading Sir

    • @sundeepsaradhi
      @sundeepsaradhi  5 років тому +4

      Hi harshitha
      Thank you very much for your support towards our channel share our channel with your friends and keep following our channel

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

    👍👍👍👍👍👍👍 🤘 explanation

  • @085_shahkalp8
    @085_shahkalp8 5 років тому +1

    See all video for link list and I saw your video that is amazing..

  • @koyavasudhalakshmi2073
    @koyavasudhalakshmi2073 4 роки тому +1

    Good explanation sir👏👏👏👏

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

    Thank u so much sir for all of your efforts!!!

  • @VijayPal-vx9es
    @VijayPal-vx9es 5 років тому +1

    You are great sir.
    Thanks for this video sir😊

  • @govardhanreddy9644
    @govardhanreddy9644 5 років тому +11

    Here in deletion at specified position we didnt kept NULL for data element 30. it is still having link to the tail. i think we need to code as :
    new=temp;//i have just taken new as another variable
    temp=temp->next;
    new->next=temp->next;
    temp->next=NULL;

  • @rakeshdebata5060
    @rakeshdebata5060 4 роки тому

    Superb Lecture but I have a doubt I mentioned it in comment already

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

    Sir if we delete 30(pos -2) than 30 of next should be null ,is it correct sir?
    " temp->next->next=NULL "

  • @bhaktidukare7147
    @bhaktidukare7147 4 роки тому

    Very nice teaching

  • @sivanandamelumalai719
    @sivanandamelumalai719 4 роки тому +1

    Thanksgiving the content

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

    Sir, I have doubt regarding to deletion at specific postion..after the forloop you wrote temp->next=temp->next->next why don't we write it as temp->next =tail...

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

      We can't write temp->next=tail because we are writing this code for a general linked list. So for example there may be a condition where we have 10 nodes and we want to delete 3rd node, so there temp->next=tail fails because tail is the last node but temp->next=temp->next->next will work in all conditions.

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

    Nice explanation sir

  • @naladesisudhakaryadav5319
    @naladesisudhakaryadav5319 4 роки тому +1

    you are not mentioning the how to reach the tail in any of the video, could you explain how can we consider tail

  • @aanchalsharma5264
    @aanchalsharma5264 5 років тому

    Superb explanation

  • @jeevann3750
    @jeevann3750 5 років тому

    Thank you soo much 🙏👏.. Sir

  • @ajaykumar-yk7to
    @ajaykumar-yk7to 3 роки тому

    Super sir😊😊

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

    sir, if we are not freeing the node i think thats much only not sufficient for deleting the node

  • @prafulsinghal
    @prafulsinghal 5 років тому +1

    Sir in deletion at specified position instead of using temp->next= temp->next->next can we use temp->next =tail

  • @tarangshivraj6160
    @tarangshivraj6160 4 роки тому

    sir big fan sir but the deletion code in the specified position, suppose the position is 3(instead of 2 in the example) and the loop iterates twice, could you elaborate on how that will work? will 2 nodes get deleted then instead of the reqd. one node, please reply sir

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

    In specified position still having link to the tail. I think we need to code. Pls reply sir

  • @harishmamohan1853
    @harishmamohan1853 4 роки тому

    Thank you sir ❤️

  • @nagendrathorati6194
    @nagendrathorati6194 5 років тому +2

    Sir can u make a video on data structure online bits.. Please respond sir..
    Thank 👉🙏💕

    • @sundeepsaradhi
      @sundeepsaradhi  5 років тому +1

      hi
      sure
      i will try to do that.
      thanks for your support towards our channel.

  • @RAZZKIRAN
    @RAZZKIRAN 4 роки тому +1

    please provide complete programs in links, so we can run the programs without any difficulty

  • @rishavkumar2302
    @rishavkumar2302 4 роки тому

    Why we did not made the next position =null of deleted element ,as done in deletion from end

  • @yarramneninikhil1299
    @yarramneninikhil1299 5 років тому +1

    Sir deallocating memory is compulsory

    • @sundeepsaradhi
      @sundeepsaradhi  5 років тому

      Hi.yes we have to deallocate the memory using free ( ) function.

    • @adityanarayan1346
      @adityanarayan1346 4 роки тому

      Then we need to traverse one more pointer variable upto that position?

  • @bhawika902
    @bhawika902 5 років тому

    awesome thanks sir

  • @akashrajput1858
    @akashrajput1858 5 років тому +1

    I think you must disconnect the link of the specified position

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

    What about deleting all the nodes?

  • @keshavburud7584
    @keshavburud7584 4 роки тому

    Sir can you explain how to free node in deletion of position!!

  • @bhawika902
    @bhawika902 5 років тому

    pls make more videos on Hash tables, including strategies for avoiding
    and resolving collisions, Binary search trees, Common operations on binary search trees such as select
    min, max, insert, delete, iterate over tree, Graphs and graph algorithms , Representations of graphs,
    Depth- and breadth-first traversals , Heaps ,Graphs and graph algorithms , Shortest-path algorithms
    (Dijkstra and Floyd) , Minimum spanning tree (Prim and Kruskal).

  • @simons-n-chotu-madness
    @simons-n-chotu-madness 4 роки тому

    Sir delete at specific position ko kese free karenge vaha pe to koi value point out ho hi nahi rahi he ???????

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

    May inflow the value of null

  • @ajaygurumadu
    @ajaygurumadu 5 років тому

    Sir,In specified position node 30 is not assigned to null

  • @rakeshdebata5060
    @rakeshdebata5060 4 роки тому

    If you assign head to temp variable then why you write head-> next

  • @syedanabahat9730
    @syedanabahat9730 5 років тому

    can u please make a video of searching node in circular linked list??

  • @arpitbharadwaj8799
    @arpitbharadwaj8799 5 років тому +3

    You are not freeing any memory so this method is not appropriate especially in the last part the node to be deleted was still pointing to the tail

  • @RAZZKIRAN
    @RAZZKIRAN 4 роки тому

    thank u sir

  • @Zscor27
    @Zscor27 5 років тому

    Hello Sir, you delete the last element but never return the node temp? @ minutes 12-14

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

    sir can u upload doubly circular lined list in c

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

    Hlw sir we are not assigned tail

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

    Thnks

  • @arpandas4912
    @arpandas4912 5 років тому

    thanku sir....

  • @master00016
    @master00016 4 роки тому

    Sir diletion in beginning main ye head = head->next kaise huwa.. Samaj nahi aa raha

    • @PratimaKumari-oj1oo
      @PratimaKumari-oj1oo 4 роки тому

      Head pointer pahele node ko point karta h maan lo head point kar raha h ek node ko jiska address 1000 h ab agar hum waha par head=head->next likhte h toh iska mtlb h ki head ab apne address part ko point karega maan lo 2000 h pahele node ke address part m toh ab head us node ko point karega jiska address 2000 h

  • @YashDEVELOPER12
    @YashDEVELOPER12 4 роки тому

    Sir I have a problem in this. and I need instant solution .plz help me

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

    Can you plz give as code completely from the header file sir....?

  • @kishankhatri8891
    @kishankhatri8891 4 роки тому

    Sir please can u provide proper code of all the process !!! And thank you sir!!

  • @simons-n-chotu-madness
    @simons-n-chotu-madness 4 роки тому +1

    Sir Apne free nahi Kiya Jo deleted node he vo

  • @julurisaiteja8853
    @julurisaiteja8853 4 роки тому +1

    Sir instead of temp of next of next, can't we use tail?

    • @kodeesr848
      @kodeesr848 4 роки тому +1

      No,if u have 7 nodes & if u want delete the 3rd element then how can we del node 3 by using tail,that's y he is using temp->next=temp->next->next

    • @ShivamMishra-ke6gi
      @ShivamMishra-ke6gi 4 роки тому

      You can declare one extra variable then

  • @saikrishnatatipamula210
    @saikrishnatatipamula210 4 роки тому

    Deletion at end...is wrong ..so please correct it..

  • @atultiwary2428
    @atultiwary2428 5 років тому

    Simply declare a temp variable and store the address of the deleted link.
    P=head;
    While(p of link not equal to head)
    {
    P=p of link;
    }
    Temp=p of link;
    P of link = temp of link;
    Free (temp);