http://dev.mysql.com/tech-resources/articles/hierarchical-data.html

Gives a great explenation of using left/right values to identify boundries of nested sets to make very efficient tree queries. Insertion and removal isn't too terribly difficult (at least through the use of MySQL functions). This'd be great if I ever needed to make a highly efficient tree set in MySQL.