From d22204818c7e89766d57dc31c3c52c34ea9d29d5 Mon Sep 17 00:00:00 2001 From: Matt Armstrong Date: Tue, 15 Feb 2022 07:33:25 -0800 Subject: [PATCH] Remove an incorrect claim about rotations from README.org The README said that "rotations don't preserve the binary search tree property" but the usual binary search rotation operations do preserve the symmetric order of nodes in the tree. Fix this by removing the statement. --- README.org | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/README.org b/README.org index 0e4085a..58252c3 100644 --- a/README.org +++ b/README.org @@ -101,9 +101,8 @@ previously otherwise NULL. ** Insertion -Trees don't store duplicate keys, since rotations don't preserve the -binary search tree property in this case. If the user needs to do so, -then he can keep a separate list of all records having the same key. +Trees don't store duplicate keys. If the user needs to do so, then he +can keep a separate list of all records having the same key. This is the reason why the insertion functions do insert a key only if the key hasn't been already inserted. Otherwise it's equivalent to a