From 4922b651775a4dc21f95fd5d34b3ea4f9b7341f0 Mon Sep 17 00:00:00 2001 From: Taylan Kammer Date: Sun, 23 Aug 2026 14:18:19 +0200 Subject: Slight rewording of last note. --- notes/260822-release3.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'notes/260822-release3.md') diff --git a/notes/260822-release3.md b/notes/260822-release3.md index 03ee8dc..fa47ab5 100644 --- a/notes/260822-release3.md +++ b/notes/260822-release3.md @@ -192,11 +192,11 @@ In this example, the trie is already "sorted" in the sense that the pointer 1234, stored in the root, is less than 1256, stored in the node 1234. What if we insert 1200? Keeping it sorted is easy: -If a pointer to be stored has a value less than the parent into which +If a pointer to be stored has a value less than a parent under which it would be stored, then move the contents of the parent into it, put it in place of the parent, and continue the insertion procedure with the parent pointer's value. I believe this is similar to rotation of -an AVL tree. +an AVL tree, though I've never worked with them. By the way, pointers most commonly have more variance in their least significant bits. That is, you are more likely to encounter pointer -- cgit v1.2.3