Tugas Algoritma dan Struktur Data II Searching BTree

Disusun Oleh :
Neny Septiana W. Nurtika Agriani Risky Ardiansyah Robert Eka Rahendi Maslikha Puspasari Rosi Cahyaning Putri Yanita Cahyaningtyas 0810960015 0810960017 0810960061 0810960063 0810963013 0810963069 0810963075

PROGRAM STUDI ILMU KOMPUTER FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM UNIVERSITAS BRAWIJAYA MALANG 2010

Algoritma
B-TREE-SEARCH(x, k) 1 2 3 4 5 6 7 8 9 i1 while i n[x] and k > keyi[x] do i i + 1 if i n[x] and k = keyi[x] then return (x, i) if leaf [x] then return NIL else DISK-READ(ci[x]) return B-TREE-SEARCH(ci[x], k)

Source Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 public Object BTreeSearch(Node c, int k) { int i = 0; while (i < c.n && (k)>c.key[i]) i++; if (i < c.n && c.key[i]==(k)) return c.key[i]; // found it if (leaf==null) return null; // no child to search else { // search child i return BTreeSearch(c.leaf, k); } } public Object search(int k) { return BTreeSearch(root, k); }