aboutsummaryrefslogtreecommitdiffstats
path: root/Documentation/rbtree.txt
diff options
context:
space:
mode:
authorCarlos Garcia <carlos@cgarcia.org>2014-04-05 02:31:00 (GMT)
committerJiri Kosina <jkosina@suse.cz>2014-05-05 13:32:05 (GMT)
commitc98be0c96db00e9b6b02d31e0fa7590c54cdaaac (patch)
tree3c189a2a2342bf4454fd8826ad61b2cb84eab6b3 /Documentation/rbtree.txt
parent07656d83085dfd3d5eff5d588a6f50c35c853ee0 (diff)
doc: spelling error changes
Fixed multiple spelling errors. Acked-by: Randy Dunlap <rdunlap@infradead.org> Signed-off-by: Carlos E. Garcia <carlos@cgarcia.org> Signed-off-by: Jiri Kosina <jkosina@suse.cz>
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 61b6c48..39873ef 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
way making it possible to do efficient lookup and exact match.
This "extra information" stored in each node is the maximum hi
-(max_hi) value among all the nodes that are its descendents. This
+(max_hi) value among all the nodes that are its descendants. This
information can be maintained at each node just be looking at the node
and its immediate children. And this will be used in O(log n) lookup
for lowest match (lowest start address among all possible matches)

Privacy Policy