Update README.markdown

Author: scalls

Radix-Tree/README.markdown

@@ -1,6 +1,6 @@
 # Radix Tree
 
-A radix tree (or radix trie, compact prefix tree) is a space-optimized tree used for constructing associative arrays that are usually expressed as strings. Edges in radix trees store strings. If you started at the root of the tree and traversed down to any node that has no children, concatenating the edges in order of traversal would result in a stored word. An example can be seen [here](https://en.wikipedia.org/wiki/Radix_tree#/media/File:Patricia_trie.svg).
+A radix tree is a tree where a node can have any number of children. Each edge leading from a node to a child has a label (usually a string). A radix tree is often used to store strings or IP addresses and by traversing from the root to any leaf in the tree, (by concatenating all the labels of edges along the way) you can find any string. This is a radix tree:
 
 ## Operations