March 2018
Beginner to intermediate
656 pages
20h 9m
English
Content preview from Mastering Blockchain - Second Edition
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Patricia trees
To understand Patricia trees, you will first be introduced to the concept of a trie. A trie, or a digital tree, is an ordered tree data structure used to store a dataset.
Practical Algorithm to Retrieve Information Coded in Alphanumeric (Patricia), also known as Radix tree, is a compact representation of a trie in which a node that is the only child of a parent is merged with its parent.
A Merkle-Patricia tree, based on the definitions of Patricia and Merkle, is a tree that has a root node which contains the hash value of the entire data structure.