1. [Algo] MCPE CMU

2. Member Group Present 1.SUTTICHAI MESAARD530632035 2SURIYA KONCHAIYAPHOM530632038 3NATTHAWOOT PUNROOB530632023 4WIWAT TAWEESUP530632103 [Algorithm] MCPE of CMU

3. Introduction  Radix-Tree  Radix search trees : do not store keys in the tree at all, the keys are in the external nodes of the tree.  Called tries (try-ee) from “retrieval” [Algo] MCPE CMU

4. Introduction Two types of nodes  Internal: contain only links to other nodes  External: contain keys and no links [Algo] MCPE CMU

5. ADT of Radix Lookup: Determines if string is in the tree. Insert: Add string in the tree. Delete: Delete string in the tree. [Algo] MCPE CMU

6. Lookup [Algo] MCPE CMU

7. Implement Lookup Start from the root node and from the most significant bit Go forward bit by bit on the trie until you find a leaf node Check if the item is in the leaf node [Algo] MCPE CMU A = 1 st 00001 Z = 24 th 11000

8. A 01 S 0 0 1 E 1 [Algo] MCPE CMU Lookup InsertA 00001.S 10011 LookupE 00101

9. Insert [Algo] MCPE CMU

10. Implement Insert Find the place of the item by following bits If there is nothing, just insert the item there as a leaf node If there is something on the leaf node, it becomes a new innernode. Build a new subtree or subtrees to that inner node depending how the item to be inserted and the item that was in the leaf node differs. Create new leaf nodes where you store the item that was to be inserted and the item that was originally in the leaf node. [Algo] MCPE CMU

11. InsertA 00001 A 01 [Algo] MCPE CMU Insert

12. A 00001 A 01 InsertS 10011 S [Algo] MCPE CMU Insert

13. A 00001 01 InsertS 10011 InsertE 00101 S 0 0 1 E 1 [Algo] MCPE CMU Insert A

14. A 00001 A 01 InsertS 10011 InsertE 00101 0 0 1 E 1 InsertR 10010 0 1 R 01 0 1 [Algorithm] MCPE CMU Insert S 0 1

15. Delete [Algo] MCPE CMU

16. Implement Delete Remove the item Remove the leaf node where the item was If the nearest sister node is also a leaf node, shorten the tree until the sister node differs only by one bit from some other branch of the tree. [Algo] MCPE CMU

17. InsertA 00001 A 01 InsertS 10011 InsertE 00101 S 0 0 1 E 1 0 1 R 01 0 1 [Algo] MCPE CMU Delete InsertR 10010 Delete R 10010

18. A 01 0 0 1 E 1 0 1 01 0 1 [Algo] MCPE CMU MoveS 10011 InsertA 00001 InsertS 10011 InsertE 00101 InsertR 10010 Delete R 10010 MoveS 10011 S

19. A 01 S 0 0 1 E 1 [Algo] MCPE CMU MoveS 10011 InsertA 00001 InsertS 10011 InsertE 00101 InsertR 10010 Delete R 10010 MoveS 10011

20. Complexity of Radix Efficient of Radix algorithm depend on Digit (d) Bucket (B) Number of data (N) runs in time O(d(B+N)) /* Incase B<<N & d is constant O(N) [Algo] MCPE CMU A = 1 st 00001 Z = 24 th 11000 {0,1}2 xxxxx5

21. Reference http://herbert.gandraxa.com/herbert/dic.asp http://code.google.com/p/patl http://www.github.com/agl/cirtbit [Algo] MCPE CMU