© 2000 Todd Neller.
A.I.M.A. t
ext
figures
© 1995 Prentice Hall.
Used by
permission.
SRBFS
•
Simple RBFS (SRBFS)
–
Local cost threshold for each recursive call
–
Has inefficiencies to be addressed in
RBFS, but good intro for teaching
purposes
–
Work the following algorithms with binary
tree where f(n) = depth(n)
