Re: Red-Black tree structure in Kernel

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



Thanks, that actually makes sense. Could it also be that if they want
to
add something to the list they first dump it at the end of the list and
defer the insertion of the irem to the tree since it takes more time to
inset in the tree and balance the red-black tree?
  
  thanks


I think they have the both the list and the tree, because they are used for
different situations.

For example if you want to find a object it is more efficient to use the tree
to search. but if you want to visit all the objects it is better to use the
list than the tree




--
Kernelnewbies: Help each other learn about the Linux kernel.
Archive: http://mail.nl.linux.org/kernelnewbies/
FAQ: http://kernelnewbies.org/faq/



Yahoo! for Good - Make a difference this year.

[Index of Archives]     [Newbies FAQ]     [Linux Kernel Mentors]     [Linux Kernel Development]     [IETF Annouce]     [Git]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux RAID]     [Linux SCSI]     [Linux ACPI]
  Powered by Linux