I just had a thought which may help you (or others), now and later, both in terms of time and computing experience...
an unordered list is like this
Code:
<ul>
<li>list item 1</li>
<li>list item 2</li>
</ul>
an ordered list is like this
Code:
<ol>
<li>list item 1</li>
<li>list item 2</li>
</ol>
and a definition list (dl) is like this
Code:
<dl>
<dt>WORD</dt>
<dd>Meaning</dd>
<dt>DEFINITION</dt>
<dd>If I knew what this word meant, I would place the definition here.</dd>
</dl>
The idea I had was that a list (the first two), are just plain old lists. The last one - the definition list (dl) is an associative list where the <dd> tags are associated with the <dt> tag.
Later in your programming - if you do some - you will hear about arrays(lists) and associative arrays (also known as hashes[in Perl]). These dl and ul are a pretty good visual of arrays and hashes and this might go some way in helping poeple to understand them better/more easily, sooner.
bazz