AVL implementation consume less memory from RB tree implementation On Thu, 19 May 2011 19:33:22 +0200 Mike Belopuhov <m...@crypt.org.ru> wrote:
> On Thu, May 19, 2011 at 7:25 PM, Michael Pounov <mi...@aitbg.com> wrote: > > Not see differences in results with performance from RB tree vs AVL, > > but right solution for problems when we have choice between algorithms. > > > > if you don't see any difference then what's the point in having them > both available? how are you supposed to choose between them? -- M.Punov --------------------- AITNET - Sofia/Bulgaria - Software & Network Solutions (+359) 888 73 73 58;(+359) 2 402 4000
