The length of each node is not the same; each character within a node is the same number of bytes long. So you end up with one node in the rope that has one lo

The length of each node is not the same; each character within a node is the same number of bytes long. So you end up with one node in the rope that has one logical character - that is some absurd number of bytes long. (In reality there'd be a maximum of 2^8-1 or 2^16-1 or something bytes per character)