No me acorde antes de mirar en wikipedia :|
Cita: A tree is an undirected simple graph G that satisfies any of the following equivalent conditions:
G is connected and has no cycles.
G has no cycles, and a simple cycle is formed if any edge is added to G.
G is connected, but is not connected if any single edge is removed from G.
G is connected and the 3-vertex complete graph is not a minor of G.
Any two vertices in G can be connected by a unique simple path.
If G has finitely many vertices, say n of them, then the above statements are also equivalent to any of the following conditions:
G is connected and has n − 1 edges.
G has no simple cycles and has n − 1 edges.
Prácticamente lo que dije con 2-3 cositas mas..
A tree is an undirected simple graph,
G has no cycles,
Any two vertices in G can be connected by a unique simple path.
G has no simple cycles and has n − 1 edges.
Y lo que tu me estas diciendo de Binary tree ( que es un TIPO de arbol ) es correcto pero no lo mismo:
Cita: In computer science, a binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child. A tree which does not have any node other than root node is called a null tree. In a binary tree, a degree of every node is maximum two. A tree with n nodes has exactly n−1 branches or degree.