© 2000 Todd Neller.
© 1995 Prentice Hall.
Simple RBFS (SRBFS)
Local cost threshold for each recursive call
Has inefficiencies to be addressed in
RBFS, but good intro for teaching
Work the following algorithms with binary
tree where f(n) = depth(n)