What is better to use for tree data structure?

Question

Database

It is necessary to make a database with categories and products, and categories can be nested into each other and products can be in the same category with other categories. Are relational databases suitable for this task? Or is it better to take something like Mongo (it seems to me that it is much easier to describe what I need in BSON)?

Answer 1

The relational basis approaches. You can use nested sets or materialized path. Read about both solutions. For both, most likely there are ready-made implementations in the language you use.
Tree structures are indeed easier to describe in Mongo, but harder to keep up to date.
I would take what is more familiar and for which it is easier for you personally to find good specialists.

Answer 2

It is better to avoid strong nesting of categories. When working with relational databases, you will have to compose complex queries with join.
If there are many relationships between entities, then sometimes it is worth trying out a solution with graph databases.
When is a graph database suitable
Well, in general, Mongo is probably not suitable for the task.
Types of NoSQL