title: Difference between ordered and unordered (rooted) trees
body: <p>I am reading algorithms by Robert Sedwick. Some definitions from the book are shown below.</p>
  
  <blockquote>
    <p>A tree (also an ordered tree) is a node (called the root) connected to
    a sequence of disjoint trees. Such a sequence is called a forest.</p>
    
    <p>A rooted tree (or unordered tree) is a node (called the root)
    connected to a multiset of rooted trees. (such a multiset is called an
    unordered forest.</p>
  </blockquote>
  
  <p>My questions on the above text are</p>
  
  <ol>
  <li>I am having difficutlty in understanding above defintions.  Can any one please explain with examples.</li>
  <li>What does author mean by disjoint trees?</li>
  <li>What does author mean by multiset rooted trees?</li>
  </ol>
  
  <p>Thanks for your time and help</p>