tree (data structure)

data structure

ref.
http://www.webopedia.com/TERM/d/data_structure.html

In programming, the term data structure refers to a scheme for organizing related pieces of information. The basic types of data structures include:

files

• lists

arrays

• records

trees

• tables

Each of these basic structures has many variations and allows different operations to be performed on the data.

ref.
http://en.wikipedia.org/wiki/Data_structure

ref.
http://cplusplus.com/doc/tutorial/structures.html

tree structure

ref.
http://www.webopedia.com/TERM/T/tree_structure.html

ref.
Steve Oualline, Practical C Programmin, 292-293p

root
node
leaves

"Recursion is extremely useful with trees. Our rules for recursion are:
1. The function must make things simpler. This rule is satisfied by trees, because as you descend the hierarchy there is less to search.
2. There must be some endpoint. A tree offers two endpoints, either you find a match, or you reach a null node.

ref.
http://en.wikipedia.org/wiki/Tree_%28data_structure%29


binary search tree
http://en.wikipedia.org/wiki/Binary_search_tree



Eric F Charlton : Tree Data Structures