You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 3 Next »

  1. Texts are build in a tree data structure

  2. A text begins with a root node; this root node generally contains the metadata for the text

  3. Pages are added to this root node; these pages are the children of the root

  4. Child pages can be added to any page; the page they are added to is the parent page

  5. Pages that share the same parent are siblings

  6. A page may have multiple children, but will have only one parent

  7. Pages will be arranged in the text according to the linear order that they appear in the table of contents

  8. For example, see the text contents below:

    • Main Title

      • Introduction

      • Section A

        • Subsection 1A

        • Subsection 2A

      • Conclusion

  9. In the example above:

    • "Main Title" is the root node

    • "Introduction," "Section A," "Section B," and "Conclusion" are the children of "Main Title"

    • "Subsection 1A" and "Subsection 2A" are the children of "Section A"

    • "Section A" is the parent of "Subsection 1A" and "Subsection 2A"

    • "Subsection 1A" and "Subsection 2A" are siblings

    • In the text, the "Main Title" would be the first page, followed by "Introduction," then "Subsection 1A," then "Subsection 2A," then "Conclusion"

  • No labels