Re: Trees

References	<mailman.17862.1421705173.18130.python-list@python.org> <54bd8e6a$0$13009$c3e8da3$5496439d@news.astraweb.com> <CABicbJK1TzXSoFQFUPXSkafzwMkYfByUfpw8QiaXiHwROOMo+Q@mail.gmail.com>
Date	2015-01-20 09:23 +0000
Subject	Re: Trees
From	Nicholas Cole <nicholas.cole@gmail.com>
Newsgroups	comp.lang.python
Message-ID	<mailman.17887.1421745832.18130.python-list@python.org> (permalink)

Show all headers | View raw

On Mon, Jan 19, 2015 at 11:52 PM, Devin Jeanpierre
<jeanpierreda@gmail.com> wrote:
> On Mon, Jan 19, 2015 at 3:08 PM, Steven D'Aprano
> <steve+comp.lang.python@pearwood.info> wrote:
>> Zachary Gilmartin wrote:
>>
>>> Why aren't there trees in the python standard library?
>>
>> Possibly because they aren't needed? Under what circumstances would you use
>> a tree instead of a list or a dict or combination of both?
>>
>> That's not a rhetorical question. I am genuinely curious, what task do you
>> have that you think must be solved by a tree?
>
> In general, any time you want to maintain a sorted list or mapping,
> balanced search tree structures come in handy.
>
> Here's an example task: suppose you want to represent a calendar,
> where timeslots can be reserved for something. Calendar events are not
> allowed to intersect.

Maybe because I'm not a computer scientist, I can't immediately see
why this is a "Tree" problem and not a "Database" problem.  Genuinely
interested.

Thread

Trees Zachary Gilmartin <zacharygilmartin@gmail.com> - 2015-01-19 17:06 -0500
  Re: Trees Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2015-01-20 10:08 +1100
    Re: Trees Michael Torrie <torriem@gmail.com> - 2015-01-19 16:19 -0700
    Re: Trees Devin Jeanpierre <jeanpierreda@gmail.com> - 2015-01-19 15:52 -0800
    Re: Trees Tim Chase <python.list@tim.thechases.com> - 2015-01-19 18:00 -0600
    Re: Trees Nicholas Cole <nicholas.cole@gmail.com> - 2015-01-20 09:23 +0000
    Re: Trees Paul Rubin <no.email@nospam.invalid> - 2015-01-20 10:02 -0800

csiph-web