aboutsummaryrefslogtreecommitdiffstats
path: root/Documentation/rbtree.txt
diff options
context:
space:
mode:
Diffstat (limited to 'Documentation/rbtree.txt')
-rw-r--r--Documentation/rbtree.txt2
1 files changed, 1 insertions, 1 deletions
diff --git a/Documentation/rbtree.txt b/Documentation/rbtree.txt
index 61b6c48871a0..39873ef41bf9 100644
--- a/Documentation/rbtree.txt
+++ b/Documentation/rbtree.txt
@@ -255,7 +255,7 @@ However, rbtree can be augmented to store such interval ranges in a structured
255way making it possible to do efficient lookup and exact match. 255way making it possible to do efficient lookup and exact match.
256 256
257This "extra information" stored in each node is the maximum hi 257This "extra information" stored in each node is the maximum hi
258(max_hi) value among all the nodes that are its descendents. This 258(max_hi) value among all the nodes that are its descendants. This
259information can be maintained at each node just be looking at the node 259information can be maintained at each node just be looking at the node
260and its immediate children. And this will be used in O(log n) lookup 260and its immediate children. And this will be used in O(log n) lookup
261for lowest match (lowest start address among all possible matches) 261for lowest match (lowest start address among all possible matches)