Binary Trees

From

Revision as of 14:26, 28 March 2009 by Admin (Talk | contribs)
Jump to: navigation, search

A binary tree is is a tree ADT that is restricted to having at most 2 children in each node contained in the tree. As computers generally operated on digital/binary logic, binary trees are very natural and efficient structures. They are useful both as a means of storing and organizing data, and as a means of representing a solution to a problem.


Here is an example binary tree:

[[Image:]]

Personal tools
MediaWiki Appliance - Powered by TurnKey Linux