Question: IN DR. RACKETT Question 4: count-tree Write a recursive function, count-tree, that counts the number of numbers in a BinaryTree. count-tree BinaryTreeNumber If a number
IN DR. RACKETT
Question 4: count-tree Write a recursive function, count-tree, that counts the number of numbers in a BinaryTree. count-tree BinaryTreeNumber If a number appears twice, count both occurrences. That is, (count-tree (make-branch (make-branch 2 (make-leaf 0) (make-leaf 0)) (make-branch 3 (make-leaf 0) (make-leaf 4))))
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
