From: Seebs Date: 2008-06-30T15:42:19+09:00 Subject: Re: data structure On 2008-06-29, Vandana wrote: > 1. The tree is balanced. > 2. Each node has a max of 5 sub nodes and min of ceil(5/2) sub nodes. > 3. The tree remains static. Number of nodes known from the beginning. > > How would I implement this in ruby? I would suggest the use of an algorithm. -- Copyright 2008, all wrongs reversed. Peter Seebach / usenet-nospam@seebs.net http://www.seebs.net/log/ <-- lawsuits, religion, and funny pictures http://en.wikipedia.org/wiki/Fair_Game_(Scientology) <-- get educated!