lec27 - Digital Search Trees Binary Tries Analog of radix...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Analog of radix sort to searching. Keys are binary bit strings. Fixed length – 0110, 0010, 1010, 1011 . Variable length – 01, 00, 101, 1011 . Application – IP routing, packet classification, firewalls. IPv4 – 32 bit IP address. IPv6 – 128 bit IP address.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Digital Search Tree Assume fixed number of bits. Not empty => Root contains one dictionary pair (any pair). All remaining pairs whose key begins with a 0 are in the left subtree. All remaining pairs whose key begins with a 1 are in the right subtree. Left and right subtrees are digital search trees on remaining bits.
Background image of page 2
Example Start with an empty digital search tree and insert a pair whose key is 0110 . 0110 Now, insert a pair whose key is 0010 . 0110 0010
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example Now, insert a pair whose key is 1001 . 0110 0010 1001 0110 0010
Background image of page 4
Now, insert a pair whose key is 1011 . 1001
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/07/2010 for the course COT 5536 taught by Professor Sartajsahani during the Spring '10 term at University of Florida.

Page1 / 25

lec27 - Digital Search Trees Binary Tries Analog of radix...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online