10 Answers
New Answera good practice strategy is to comment out one section of the code. then try to reproduce it from memory. try to understand it first though. if you make any mistakes, then make a note of where you went wrong and learn from it. comment it out and try again several times till youre perfect. i repeat. just focus on one section at antime, not the whole code
You can follow mycodeschool .you will get there one of the best videos of data structure. First learn array,pointer , structure and dynamic memory allocation,searching and sorting Sequence of learning 1.linkedlist 2.stack 3. queue 4.tree 5.hashing 6.graphs You can prefer Shrivastava book
First we should need to learn all basic term word in Ds like stack ,queue and then you strong in coding linked list and array in c and u learn deeper
After learning each topic .do code on geeks for geeks and hackerrrank . Your concept will clear
it begins with the array as they are the building blocks of ADT there are linear ADT(stack, Queue, linked lists) and dynamic ADT (tree, hash table, graphs) it is also important to bare in mind that some algorithms are best suited for a particular data structures
I understand data structure easily but when I I implement data structure like stack queue tree I have difficult to implement it
Learn Playing. Play Learning
SoloLearn Inc.
4 Embarcadero Center, Suite 1455Send us a message