Hi all, My queation is, why there are lists everywhere and not AVL or like that data structures which give O(lgn) performance in linux kernel. except at some part in kernel like the PID are retrived from hash table and AVL i think at 1 or 2 places otherwise all there are liste and not trees plz. give a satisfactory explaination of that thanks __________________________________ Do you Yahoo!? Yahoo! Hotjobs: Enter the "Signing Bonus" Sweepstakes http://hotjobs.sweepstakes.yahoo.com/signingbonus -- Kernelnewbies: Help each other learn about the Linux kernel. Archive: http://mail.nl.linux.org/kernelnewbies/ FAQ: http://kernelnewbies.org/faq/
