Please enable JavaScript.

Coggle requires JavaScript to display documents.

Trees - Coggle Diagram

- - - - each of its connected components is a tree
- - - - For every two vertices in a tree, there always exists exactly one simple path from one of these vertices to the other
        
        Usually depicted by placing its root on the top
        
        Level 0 of the Tree
    - - A rooted tree in which all the children of each
        vertex are ordered
    - - Ordered tree in which every vertex has no more than two children and each child is designated as either a left child or a right child of its parent
      - Can also be empty
      - Usually implemented for computing purposes by a collection
        of nodes corresponding to vertices of the tree
    - - A number assigned to each parental vertex is larger than all
        the numbers in its left subtree and smaller than all the numbers in its right subtree.