Tree testing: Difference between revisions

Revision as of 12:22, 16 September 2009

Revision as of 13:06, 16 September 2009

Line 1:

'''Tree testing''' is a [[usability]] technique for evaluating the [[findability]] of topics in a website. It is also known as '''reverse [[card sorting#Reverse_card_sorting|reverse card sorting]]''' or '''card-based classification'''<ref name="CBC article" >{{cite web

|title=Card-Based Classification Evaluation

|url=http://www.boxesandarrows.com/view/card_based_classification_evaluation

Line 10:

Unlike traditional [[usability testing]], tree testing is not done on the website itself; instead, a simplified text version of the site structure is used. This ensures that the structure is evaluated in isolation, nullifying the effects of navigational aids, [[visual design]], and other factors.

== Basic Methodmethod ==

In a typical tree test:

# The participant is given a "find it" task (e.g. "Look for brown belts under $25").

Line 19:

# Once several participants have completed the test, the results are analyzed for each task.

== Analyzing the Resultsresults ==

The analysis typically tries to answer these questions:

* Could users successfully find particular items in the tree?

Line 27:

* Overall, which parts of the tree worked well, and which fell down?

== Tools ==

Tree testing was originally done on paper (typically using [[index cards]]), but can now also be conducted using specialized software.