Example: Multiple Returns

function binary-tree-search(subtreeptr, value) {

treeptr left, right

if subtreeptr.val = value return subtreeptr

if subtreeptr.left

left := binary-tree-search(subtreeptr.left, value)

if left = value return left

if subtreeptr.right

return binary-tree-search(subtreeptr.right, value)

return null}

main (root, value){

binary-tree-search(root, value)}

Call stack

bts(0,val) <- 6

bts(1, val) -> null 3rd

bts(2,val) -> null 1st

bts(3,val) -> null 2nd

bts(4,val)-> 6 3rd

bts(5,val) -> 6 2nd

bts(6,val) -> 6 1st

0

1

2

3

4

5

6

7

Previous slide

Next slide

Back to first slide

View graphic version