Question: ; Determines if the BST contains the given value. Use an efficient ; algorithm. ;(BSTContainsValue '(() 4 ()) 4) --> #t ;(BSTContainsValue '(() 4 ())
; Determines if the BST contains the given value. Use an efficient ; algorithm. ;(BSTContainsValue '(() 4 ()) 4) --> #t ;(BSTContainsValue '(() 4 ()) 10) --> #f ;(BSTContainsValue '((() 4 ()) 6 (((() 8 ()) 9 (() 10 ())) 12 ())) 10) --> #t ;(BSTContainsValue '((() 4 ()) 6 (((() 8 ()) 9 (() 10 ())) 12 ())) 100) --> #f ;(BSTContainsValue '((() 4 ()) 6 (((() 8 ()) 9 (() 10 ())) 12 ())) 6) --> #t (define (BSTContainsValue bst value) #f )
use scheme
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
