Trees

From TRCCompSci - AQA Computer Science
Revision as of 21:31, 26 November 2017 by Mfrederick (talk | contribs)
Jump to: navigation, search
Tree-1.jpg

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.

What is a Binary Tree Search