Plateforme Level Extreme
Abonnement
Profil corporatif
Produits & Services
Support
Légal
English
Binary tree very slow!
Message
Information générale
Forum:
Visual FoxPro
Catégorie:
Autre
Divers
Thread ID:
00057594
Message ID:
00059190
Vues:
34
>
> A(1,14)
> |
> ------------------
> | |
> B(2,7) C(8,13)
> | |
> ---------- ----------
> | | | |
> D(3,4) E (5,6) F(9,10) G(11,12)
>
>
>where the first number in parenthesis represents left child and the second one the right child. You can extract each subtree easy by doing a query to get only nodes that are in between the left and the right numbers of a node.
>There's some manipulations to do when comes the time to insert a node but it's not so complicated.
>
François,

This makes me think to genealogy where there is a comparable system called "Soza" numbers. By giving your ancestors a Soza name you know where they are in the tree. Well, that was by the time researchers were doing their things by hand...

José
Précédent
Répondre
Fil
Voir

Click here to load this message in the networking platform