I am not 100% sure if this is the way to do it and there may b better ones out der.
Imagine ders a MySql table called categories:
+----+------------------+------+
| id | name | pId |
|---------------------------------
| 1 | Life | 0 |
|---------------------------------
| 2 | Music | 1 |
|---------------------------------
| 3 | Hip-Hop | 2 |
|---------------------------------
| 4 | Artist | 3 |
+----+------------------+-----+
So basically if a category doest have a parent, as in the case of 'Life' in ur example, its pid will b 0. If a category does have a parent, then its pid will be the id of the parent. This structure allows for infinite level deep tree structure.
Given any category, u can trace back the tree structure by looking at the pId.
This is jus my 2 cents, der myte be better solutions out der.