docs: rbtree.rst: Fix a typo

s/maintanence/maintenance/

Signed-off-by: Bhaskar Chowdhury <unixbhaskar@gmail.com>
Acked-by: Randy Dunlap <rdunlap@infradead.org>
Link: https://lore.kernel.org/r/20210324080046.20709-1-unixbhaskar@gmail.com
Signed-off-by: Jonathan Corbet <corbet@lwn.net>
This commit is contained in:
Bhaskar Chowdhury 2021-03-24 13:30:46 +05:30 committed by Jonathan Corbet
parent a8f2a68e42
commit 399bfc8b29

View File

@ -201,7 +201,7 @@ search trees, such as for traversals or users relying on a the particular
order for their own logic. To this end, users can use 'struct rb_root_cached' order for their own logic. To this end, users can use 'struct rb_root_cached'
to optimize O(logN) rb_first() calls to a simple pointer fetch avoiding to optimize O(logN) rb_first() calls to a simple pointer fetch avoiding
potentially expensive tree iterations. This is done at negligible runtime potentially expensive tree iterations. This is done at negligible runtime
overhead for maintanence; albeit larger memory footprint. overhead for maintenance; albeit larger memory footprint.
Similar to the rb_root structure, cached rbtrees are initialized to be Similar to the rb_root structure, cached rbtrees are initialized to be
empty via:: empty via::