Difference between revisions of "Trees"
Mfrederick (talk | contribs) |
|||
| Line 1: | Line 1: | ||
| + | [[File:Tree-1.jpg|300px|thumb|right]] | ||
| + | |||
==What is a Tree== | ==What is a Tree== | ||
A tree is a '''connected''', '''undirected''' graph with '''no cycles''' in it. | A tree is a '''connected''', '''undirected''' graph with '''no cycles''' in it. | ||
Revision as of 20:31, 26 November 2017
Contents
What is a Tree
A tree is a connected, undirected graph with no cycles in it.
Connected
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.
