Why don't we use Tree representation structure for graphs

We can have vertex represent as a pointer with as many out degrees as possible. Each pointing to the address of the adjacent vertex. We can even store weights for each adjacent vertex. What would be the disadvantage in using this representation?

hi @tanmay777
What u are saying we can do like that… but implementation becomes much more complex, while it’s quite easy using maps and all…

@tanmay777
is there anything else??

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.