Re: Sorted heap trees
- From: Jon Harrop <usenet@xxxxxxxxxxxxxx>
- Date: Fri, 28 Mar 2008 22:27:15 +0000
Richard Harter wrote:
It turns out that there are some special situations where a
sorted heap tree is better than an ordinary BST. I am wondering
if anyone knows the proper name for these type of trees and of
any references, e.g., properties, uses, adaptations of standard
algorithms for them.
I call them search trees. The most common form in computer science is
balanced search trees, where the maximum depth is O(log n). In natural
science, you can often accelerate computations by not balancing the tree.
An example of this is given at the end of chapter 3 of OCaml for Scientists.
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/products/?u
.
- Follow-Ups:
- Re: Sorted heap trees
- From: cri
- Re: Sorted heap trees
- References:
- Sorted heap trees
- From: Richard Harter
- Sorted heap trees
- Prev by Date: Re: Sorted heap trees
- Next by Date: Online Matrimony
- Previous by thread: Re: Sorted heap trees
- Next by thread: Re: Sorted heap trees
- Index(es):
Relevant Pages
|
