Binary trees (better than AVL) source available

JHNSNIHB

Delphi Developer

Sat, 03 Oct 1998 03:00:00 GMT

Binary trees (better than AVL) source available

I discovered a way to balance trees without having an extra data field
in each node. It is written in object Pascal and creates abstract types
that can be used to setup a self- balancing data tree. I would like to
share if there is an interest.

.-={[Mirage]}=-

Delphi Developer

Sat, 03 Oct 1998 03:00:00 GMT

Re:Binary trees (better than AVL) source available

Go for it!

Quote

On Mon, 15 Apr 1996, JHNSNIHB wrote:
> I discovered a way to balance trees without having an extra data field
> in each node. It is written in object Pascal and creates abstract types
> that can be used to setup a self- balancing data tree. I would like to
> share if there is an interest.

Antonio Gómez-Escalonilla Zapardi

Delphi Developer

Mon, 05 Oct 1998 03:00:00 GMT

Re:Binary trees (better than AVL) source available

Quote

JHNSNIHB <JHNSN...@metrolink.net> wrote:

:>I discovered a way to balance trees without having an extra data
field
:>in each node. It is written in object Pascal and creates abstract
types
:>that can be used to setup a self- balancing data tree. I would like
to
:>share if there is an interest.

Im interested. Post me or follow-up the article with any attachment

Other Threads

1. AVL tree classes (with sources) is available

2. AVL tree (balanced binary tree) implementation needed

3. AVL (Balanced) Binary Tree

4. Looking for Expresion Tree/Binary Tree algorythms

5. I want to create a graphical tree as the binary tree

6. Does anyone have any precedures for avl trees?

7. AVL tree code (TP 7.0)

8. AVL trees implementation in paskal

9. AVL TREE

10. AVL trees in paskal