Lesson Organising information: tree
Organising information: trees
- Trees are hierarchical data structures that represent relationships, like family trees or textual structures in markup languages. In computing, they organize data using nodes linked by parent-child relationships. Each tree has a single root node, while nodes at the end are called leaf nodes. Trees are used to structure texts, databases, and various hierarchical systems. Python's anytree package provides tools to create, modify, and visualize trees.
- Recommended reading:
- Tree: A hierarchical data structure consisting of nodes connected by parent-child relationships.
- Node: The fundamental unit of a tree, containing data and references to child nodes.
- Root Node: The topmost node of a tree without any parent.
- Leaf Node: A node without any children, located at the bottom of the tree.
- Parent Node: A node directly connected to another node closer to the root.
- Child Node: A node directly connected to another node further from the root.
- Sibling Node: Nodes that share the same parent.
- Markup Language: A system for annotating documents that is readable by humans and machines, often represented as a tree (e.g., HTML, TEI).
- Gabriel García Márquez: Colombian author used to illustrate hierarchical structures through family trees in literature.