Data structures: TREES

Data structures: TREES

1. Concept

   • Set of information nodes

2. Characteristics and properties

   • Nodes
     • Elements or vertices of a tree
   • Root
     • Node that descends to the other elements of the tree
   • Father
     • The predecessor of a node, except root node
   • Children
     • Descendant of a node
   • Leaf
     • Number of children leaving a node
   • Brothers
     • Nodes that are descendants of the same node
   • Level
     • Number of predecessors that have from the root
   • Height
     • Maximum levels of nodes in a tree
   • Weight
     • Number of terminal nodes
   • Interior Node
     • Node that is not root or terminal or sheet
   • Degree of a Tree
     • Maximum grade of all tree nodes

3. Binary trees

   • Principal Characteristic
     • They can not have more than two children nodes
   • They have two terms:
     • Left subtree
     • Right subtree
   • Tours of trees
     • Preorder of trees
     • Post of trees
     • Inorder of trees

Images and files in the map