balanced tree
A balanced tree is a rooted tree
where no leaf is much farther
away from the root than any other leaf.
Different balancing allow different definitions of ”much farther” and
different amounts of work to keep them balanced. For an example, see binary tree
.
| Title | balanced tree |
|---|---|
| Canonical name | BalancedTree |
| Date of creation | 2013-03-22 12:29:11 |
| Last modified on | 2013-03-22 12:29:11 |
| Owner | Mathprof (13753) |
| Last modified by | Mathprof (13753) |
| Numerical id | 7 |
| Author | Mathprof (13753) |
| Entry type | Data Structure |
| Classification | msc 05C05 |
| Related topic | Tree |
| Related topic | BalancedBinaryTree |
| Related topic | Heap |
| Related topic | BinaryTree |