Lec-20: Traversing in Linked list | Data Structure

  Рет қаралды 126,307

Gate Smashers

Gate Smashers

Күн бұрын

Пікірлер: 75
@crsharna1556
@crsharna1556 2 жыл бұрын
I REALLY APPRECIATE UR METHOD OF EXPLANING THE CONCEPT.. U GUYS ARE REALLY DOING A GREAT JOB IN UNDERSTANDING COMPUTER SCIENCE CONCEPTS IN EASY GOING WAY. ALL THE VERY BEST !!
@Mallikarjuna5383
@Mallikarjuna5383 Жыл бұрын
We can initiate i=0 and we can add i=i+1 in for loop statement and then print it ouside to know nunber of the nodes in the given list
@deepmukherjee2131
@deepmukherjee2131 2 жыл бұрын
Varun sir and naina mam both are just awesome. Thank you so much 💕
@ItsTabinda
@ItsTabinda Жыл бұрын
One more thing to add first node ko hum head node kehtey hain and last node ko hum tail kehtey hain and head not only a pointer that only point first node it is an actual node that contains data and its reference part contains address of the next node. Similarly tail is the last node which contains data and its reference part points to NULL yeah baat kisi ne bhiii naiii bataiiii
@BCA_KA_BANDA2003
@BCA_KA_BANDA2003 Жыл бұрын
While(ptr->next!=null) condition jb apply hogi then, all the nodes before last nodes hongi whi loop k condition ko follow karengi aur inside the loop jo statement hongi use print krr degi.❤😊🎉
@amanamarnath6373
@amanamarnath6373 Жыл бұрын
Mam the way of your explanation is great..❤
@GateSmashers
@GateSmashers Жыл бұрын
Thank you so much..
@ShujaatShoaib654
@ShujaatShoaib654 2 жыл бұрын
If we use this condition While(ptr->next!=null) then last node traverse nhi ho ga
@ronipaul1705
@ronipaul1705 2 жыл бұрын
It'll not not enter the loop .. After checking condition it'll exit ... Cause condition is false.
@prathasaxena9474
@prathasaxena9474 2 жыл бұрын
Awesome ma'am...... Now i get to know how to write code.... Ab to iska bus cramming kiya tha..... Thank you so much ma'am for explaining in innovative way☺😍👍
@Tbm4545
@Tbm4545 2 жыл бұрын
Kutch bhi mat bol ab karke dhika aut ek bar
@Tbm4545
@Tbm4545 2 жыл бұрын
Aur asli mein ata hai to muje tops de ki sikhan kaise hai 🙄
@apurbadey9987
@apurbadey9987 2 ай бұрын
What a lecture !😊
@devanshbaijal7090
@devanshbaijal7090 2 жыл бұрын
Mam please bring more videos of dsa ASAP mam and please mam complete the dsa playlist Mam your teaching style is awesome😊
@Tamanna_K_Hardy
@Tamanna_K_Hardy 2 жыл бұрын
Great as Always Naina mem 😎👍
@Funlearninghub566
@Funlearninghub566 3 ай бұрын
Thanks for this amazing explanation 👍👍🙏
@ektapandey5387
@ektapandey5387 2 ай бұрын
Is this playlist sufficient for cuetpg "Data Structures"???
@vaibhavrathod9674
@vaibhavrathod9674 2 жыл бұрын
Once again, Thank you so much for this, even I can't express this Thankfullness through my word... Thank you so muchhhhhh.....
@delusional_being
@delusional_being 2 жыл бұрын
Ma'am please course complete karwaayie aap please aap bohoth acha padhaati hai
@sakshamsinha1763
@sakshamsinha1763 9 ай бұрын
Best explanation ma'am
@sscode3809
@sscode3809 2 жыл бұрын
Mam ptr ka next null ke equal nahi to loop tab Tak chalega jab tak ptr null ke equal na ho gayae
@vaibhavrathod9674
@vaibhavrathod9674 2 жыл бұрын
Thank you so much for this.....mam
@vinitgurnani3598
@vinitgurnani3598 Жыл бұрын
ptr ---> != null , condition will check and if true then goes in loop until condition become false (ptr ---> = null).
@pldash4862
@pldash4862 Жыл бұрын
THANK YOU MA'AM
@DeadXstrom
@DeadXstrom Жыл бұрын
Mam easy explanation thanks
@prashantgurjar2168
@prashantgurjar2168 10 ай бұрын
Ma'am plz explain pointer and it's types and plz explain the empty brackets in algorithms what it means, i am a Little bit confused about them. And tysm for this content ma'am 🙏😊
@RahulBhatia-py1iv
@RahulBhatia-py1iv Жыл бұрын
Thanks mam😊
@RahulSharma-tl9dv
@RahulSharma-tl9dv 2 жыл бұрын
I love u Sooo Much Mam,, U r Really a Great Teacher😍
@aqsasadaqat4539
@aqsasadaqat4539 2 жыл бұрын
While(ptr->next! =null) hoga tu infinite loop chlyy gaa..... Loop break nhi hi ga phrr
@HarshYadav-rz6zz
@HarshYadav-rz6zz 2 жыл бұрын
Wrong
@ProGaMer330.
@ProGaMer330. 2 жыл бұрын
Segmentation fault
@ronipaul1705
@ronipaul1705 2 жыл бұрын
It's not a infinite loop ...after Checking condition ,it ll exit the loop ...
@paprighosh6063
@paprighosh6063 Жыл бұрын
​@@ronipaul1705yep it's right
@laibarukhsar7359
@laibarukhsar7359 Жыл бұрын
It will not traverse last node then
@akankshakumari3348
@akankshakumari3348 2 жыл бұрын
Nice explanation mam
@techwithaj56
@techwithaj56 2 жыл бұрын
very nice mam asowsme
@ranabindumondal9301
@ranabindumondal9301 2 жыл бұрын
MADAM you lovely❤and your teaching style just fire. THANK YOU MAM.
@mohitkaushik21
@mohitkaushik21 2 жыл бұрын
Thanks mam
@Thefreakengineer
@Thefreakengineer 2 жыл бұрын
superb ma'am ✌️😅
@ShamsaMunir-z9n
@ShamsaMunir-z9n 9 ай бұрын
Thank u mam ma kafi days sa ds ke bht sari vds watch ke but smj ni aiaa es channel pa vds dekhi to thora bht pallaa pr raha hn....
@ItsTabinda
@ItsTabinda Жыл бұрын
And one more ap ne yeah to bataya hi nai baqi videos mai like circular linked list kay hum kun use kartey and you did not give real life example in any video plzzz mam sath sath example bhi diyaa karen
@mianarshad6596
@mianarshad6596 2 жыл бұрын
nice mam ji
@VIDEOIDEASRACHIT
@VIDEOIDEASRACHIT 10 ай бұрын
Number of nodes ko check karne ke leya ek I variable lega and usko increment karte Jaya ga...
@crsharna1556
@crsharna1556 2 жыл бұрын
if next!=null. while loop will run infinite times... ptr will keep traversing
@manasranjanpari1379
@manasranjanpari1379 2 жыл бұрын
Yes if next is not equal to null, but agar next=null hojata hai so loop will terminate. Until it matches null, it will keep traversing
@killerfixgaming12
@killerfixgaming12 Жыл бұрын
Mera bhi yhi answer hai
@VishalTiwari-bs4pk
@VishalTiwari-bs4pk 6 ай бұрын
Can we get notes!?
@priyam312
@priyam312 Жыл бұрын
Ye code algo to alag hota hoga na
@ambershakoor7246
@ambershakoor7246 Жыл бұрын
Traverse (struct node* head) is may error ku aa RHA ha ??
@Eclipso619
@Eclipso619 2 жыл бұрын
😇......... 🎯🔥🔥🔥🔥
@ebn-e-adam190
@ebn-e-adam190 2 жыл бұрын
Please real time application and real time k bary me video bna dein. Inka difference bta dein... Please urgently. Kl tk
@dhruvsavani619
@dhruvsavani619 Жыл бұрын
mam pls make videos related to stack , queue , trees , hashing according to gtu syllabus
@ahsankhan-rt2kh
@ahsankhan-rt2kh Жыл бұрын
Mam ye run kyun nhi ho raha
@gajrajsingh5487
@gajrajsingh5487 Ай бұрын
Infinity loop chal jayega
@kamrankamran8476
@kamrankamran8476 Жыл бұрын
Then loop will not terminate
@killerfixgaming12
@killerfixgaming12 Жыл бұрын
Sabse phle mujhe eak count=0 variable lena hai uske baad while ke ander hme count++ krna hoga
@officialvijaymanjhi9899
@officialvijaymanjhi9899 5 ай бұрын
hlo mam big fan pr meri ek prblm plzz aap camera thoda or niche krlo aapko dekhne m prblm ho rha h i hope u understand
@Lovelyqoutes-o8s
@Lovelyqoutes-o8s 2 жыл бұрын
Mam IAM you big fan
@nishansuryavanshi8705
@nishansuryavanshi8705 4 ай бұрын
Is the code in C or C++ language?
@Tbm4545
@Tbm4545 2 жыл бұрын
Video pause karke likhu kaise. Pehle baisce hi nahi ati. Link list code likhte kaise hai wo. Theroy part muje sab logonka smaja mein ata hai. Yaha tak ki college ke professor ka lekin program likhaneko nahi ata 🙄
@Chirag.sharma67743
@Chirag.sharma67743 2 жыл бұрын
If ptr != next then it goes to infinite loop .
@eclipse8321
@eclipse8321 Жыл бұрын
wrong
@mianarshad6596
@mianarshad6596 2 жыл бұрын
program run infinite time according to last in program. that you added in program.
@vaibhavrathod9674
@vaibhavrathod9674 2 жыл бұрын
Here; While( ptr-> next != NULL) ...... Here it can't print data of first node.
@yashpandey2548
@yashpandey2548 2 жыл бұрын
instead of ptr = ptr ---- next ,, we cannot write ptr = 1
@yashpandey2548
@yashpandey2548 2 жыл бұрын
we can or cannot use increment in this maam
@goodmorning9856
@goodmorning9856 Жыл бұрын
Mam haryana te ha❤
@sumitraj6878
@sumitraj6878 2 жыл бұрын
loop will exit after ptr becomes equal to 2000.
@jatinanand5520
@jatinanand5520 10 ай бұрын
are you wife of this channel anchor?
@IrshadAlam-b4z
@IrshadAlam-b4z Ай бұрын
Bakwas padha Rahi hai
Lec-21: Insert a node at the beginning of Linked list | Data Structure
10:44
When you have a very capricious child 😂😘👍
00:16
Like Asiya
Рет қаралды 18 МЛН
Une nouvelle voiture pour Noël 🥹
00:28
Nicocapone
Рет қаралды 9 МЛН
3.3 Stack implementation using Linked List | Data Structures and Algorithm Tutorials
27:01
Traversing a Single Linked List (Counting the Nodes)
6:07
Neso Academy
Рет қаралды 490 М.
Lec-19: The Basic Operations of Linked List | Data Structure
8:28
Gate Smashers
Рет қаралды 134 М.
Lec-22: Insert a node at the end of Linked List | Data Structure
14:44
Lec-28: Introduction to Doubly Linked List | Data Structure
9:57
Gate Smashers
Рет қаралды 81 М.
Lec-17: Arrays vs Linked Lists | Data Structures
8:41
Gate Smashers
Рет қаралды 131 М.
Lec-25: Delete a node from the end of Linked List | Data Structure
12:53