Difference between revisions of "Trees"
Mfrederick (talk | contribs) |
(→Connected) |
||
| Line 5: | Line 5: | ||
===Connected=== | ===Connected=== | ||
| + | All nodes must be connected to other nodes so that no part of the graph is separated. An unconnected graph is essentially 2 separate graphs. | ||
===Undirected=== | ===Undirected=== | ||
Revision as of 10:00, 29 November 2017
Contents
What is a Tree
A tree is a connected, undirected graph with no cycles in it.
Connected
All nodes must be connected to other nodes so that no part of the graph is separated. An unconnected graph is essentially 2 separate graphs.
Undirected
No Cycles
What is a Rooted Tree
A tree with one vertex singled out as a starting point.
What is a Binary Tree
A binary tree is a graph with no cycles in which each node is succeeded by a maximum of 2 nodes, a 'left' child and a 'right' child, therefore they can be either directed or undirected.
