routing lc-trie fustrated me a lot, please help.

hi:
     i currently do some work on linux networking, the code version is
2.6.39, however, i think what confused me does a litte matter with the
code version. i
viewed the routing code within the kernel, the routing algorithm of
lc-trie seems very complicated. i have seen the article posted by
niclo for the explanation of lc-trie and understand the basic
principle of trie tree, path compression. while, the code still made
me very frustrated, especilly the insert and search code, i mean
fib_insert_node and fib_find_node functions. could u give me
explanation about them, aslo can u introduce me some high quality
books concerning 2.6 networking, i tried to got some from web but
failed. thx indeed, and hope hear from u .

best regards