I decided to go with using python's hash to get the strings into the binary tree. While I would have loved to get them in alphabetically, it was just a problem that was out of my realm. Hash was right there... already working and ready for use. Maybe I'll come back to it and try to tool with it later. So I just ran tests on the 'get', 'set' and 'delete' of this. I was using the dump without problems, and the count in the pytest without issue. It's definitely not perfect or anything worth using I'm sure, but learning. That's the goal. It's basically just the Binary tree with a few tweaks. The Node has a new 'string_value' to hold the hash number we create with the method 'ConvertString', we use that to set, delete and get the nodes. the key and value don't do anything in those methods, they just get placed, and hold their places. I also still use my self.median.... though I think if I'm using hash,...