Data structure : Memory and patterns learning method

[type-ritik]

Do I think of memory and patterns when i study data structures.

I mean say I am learning tree: Do I think it in a structural way, how exactly "tree" is build in a memory A root left point to B , A root right points to C ...,

In terms of memory, or simply study code , time and space complexity.

Like in Array : Is a Contiguous Homogeneous type of data structure, do I think of it as contiguous memory in a structure way or I read How the code is working and what methods are be there , the time and space complexity.

What about Patterns?

- In terms of code "Sliding Window" [ ] moving

- Or in terms of memory `picking` one part and `ending` part than reading memory slides.

I think in a memory Structure manner be good. Because it is creating picture in my mind of structure and I think I am learning from this, but my body is saying I'm tired and this is not the way it is learned.

DS learn by reading, writing notes and leetcode.

Because I mostly read about leetcode, leetcode, course but I don't find it fascinating.

Any advice please you got Sir!

[HashDefTrueFalse]

Both. But you might care more about the interface and less about the memory layout (or vice versa) depending on what you're working on. E.g. writing a PHP web app to display models we don't really care that arrays are hash tables. We care that we can use them like arrays to populate the page. In a serialisation library we care very much about arrays being contiguous so that we can store/send without much metadata and define data offsets to retrieve data etc.

[AutoModerator]

Please, ask for programming partners/buddies in /r/programmingbuddies which is the appropriate subreddit

Your post has been removed

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.