Please enable JavaScript.
Coggle requires JavaScript to display documents.
Mapa Mental 8 - Coggle Diagram
Mapa Mental 8
Tree
A tree (more accurately, a free tree) is a connected acyclic graph
-
Rooted Trees
Another very important property of trees is the fact that for every two vertices in a tree, there always exists exactly one simple path from one of these vertices to the other
-
-
Ancestors
For any vertex in a tree , all the vertices on the simple path from the root
to that vertex are called ancestors of
Parents and childs
If (u, v) is the last edge of the simple path from the root to vertex v (and u = v), u is said to be the parent of v and v is called a child of u;
-
-
-
-
-
-
-
Binary Tree
An 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;
-
-
