ide: pdc202xx_new: Replace timeval with ktime_t

[karo-tx-linux.git] / Documentation / rbtree.txt

diff --git a/Documentation/rbtree.txt b/Documentation/rbtree.txt
index 61b6c48871a0163a12e4faec50064f61c819b5c6..39873ef41bf9fc1a72b8a2e9ace8284babe74abe 100644 (file)
--- 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)