Please enable JavaScript.
Coggle requires JavaScript to display documents.
Trees - Coggle Diagram
Trees
Types of trees
Ordered trees
Rooted tree wich all the children are ordered
Examples
Multiway search tree
Efficient way to reach ancd acess large data
Binary search tree
Specially used in computer enviroments, like nodes or research algorithms
Elemens are ordered by nodes
The size of the tree is comonly the height, but this can change from one to another iteration of the tree
Traversal binary tree
Finite set of nodes that are either empty or are a root and two disjointeed minary sub-trees
Descends of the divide and conquer technique
The tree have external nodes that extend the internal nodes of the tree.
Rooted trees
The root is the level 0 of the tree
Important role in the computer science
Can be used in various apllications, as hierarchies, dictionaries, data encoding, etc.
Recursive algorithms
All vertices come form the root or its descendents, the last edge of the tree is caled a child and the predescessor the parento or ancestor
Vertex with no children is called leaf
Height of the tree is the lenght of the longest simple path from the root to the leaf
acyclic graph
Conjunct of trees is called a forest