Re: [gtk-list] GLIB's N-ary trees
- From: Havoc Pennington <hp redhat com>
- To: gtk-list redhat com
- Subject: Re: [gtk-list] GLIB's N-ary trees
- Date: 23 Jan 2000 19:19:45 -0500
Derek Simkowiak <dereks@kd-dev.com> writes:
> Are Glib's N-ary trees any different from a normal BTree? (I
> haven't seen the term "N-ary" used to describe such trees before)
>
GTree is a sorted binary tree suitable for key-value pairs, GNode
doesn't know anything about its contents it's just a generic
tree-shaped structure (like an XML document or a parse tree or CTree
contents).
Havoc
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]