|
|
|
Viewing Version
2
of
'balanced tree'
|
[ view 'balanced tree'
|
back to history
]
| Title of object: |
balanced tree |
| Canonical Name: |
BalancedTree |
| Type: |
Data Structure |
| Created on: |
2002-02-25 21:07:05 |
| Modified on: |
2002-05-03 06:57:59 |
| Classification: |
msc:05C05 |
Preamble:
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts} |
Content:
| A \emph{balanced tree} is a rooted tree where each subtree of the root has an equal number of nodes (or as near as possible). For an example, see binary tree. |
|
|
|
|
|
