I just completed a Data structures and Algorithms course in my university. I know how data structures work and how different DS are used to solve specific and to improve efficiency. I have also started to work with databases to develop CRUD applications.
My question is: If I have to for example, use a tree data structure (like a max heap) or maybe a linked list, would I just store it in a plain table and then fetch it and re form that data structure? This seems like a lot of work when you have larger data sets, and the same goes with appending data to that data structure and saving it in database.
I have seen a lot of online explanations here and on stackoverflow, but I couldn't get a satisfactory answer to clear my understanding. I would be grateful if anyone answers it thoroughly and doesn't marks it duplicate. Thanks :)