private ByteTrieNode<T> getTransition(ByteTrieNode<T> ptr, byte value) {
		ByteTrieNode<T> child = ptr.getChild(value);
		while (child == null && ptr != root) {
			ptr = ptr.suffix;
			child = ptr.getChild(value);
		}
		if (child != null) {
			return child;
		}
		return root;
	}
Find our transition, either our child, or our suffix's child, etc. etc.
@param ptr the current node pointer
@param value the next byte value
@return the proper transition node
Ghidra/Features/Base/src/main/java/ghidra/util/search/trie/ByteTrie.java