in reply to Advanced Data Structure Question

I think a plain old binary tree should do fine with this.

Since you have a limited number of elements, asymptotic performance is not as important as you think. Fast enough will stay fast enough if the data size can't grow.

After Compline,
Zaxo

Replies are listed 'Best First'.
Re^2: Advanced Data Structure Question
by Limbic~Region (Chancellor) on Apr 19, 2006 at 14:39 UTC
    Zaxo,
    What exactly is a plain old binary tree? I ask because I am using Mastering Algorithms With Perl and it suggests that a plain old binary tree is only balanced on initialization. After enough modifications have been made it may be no more efficient than a linked list. Perhaps this is just the book's way of introducing various methods of balancing by demonstrating a need and, in reality, all binary trees are assumed to have inheritent balancing.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom