Difference between revisions of "Trees"

From TRCCompSci - AQA Computer Science
Jump to: navigation, search
(What is a Rooted Tree)
(What is a Binary Tree)
Line 6: Line 6:
  
 
==What is a Binary Tree==
 
==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==
 
==What is a Binary Tree Search==

Revision as of 08:56, 23 May 2017

What is a Tree

A tree is a connected undirected graph with no cycles in it.

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