previous | index | next

Implementing Binary Search Trees: Selectors

Suppose left and right are BSTs. We want selectors to work like: 
     (define my-bst (make-nonempty-tree 4 left right)) ⇒ creates the list (4 left right)

     (root my-bst) ⇒ 4

     (left-subtree my-bst) ⇒ left

     (right-subtree my-bst) ⇒ right
Selectors: 
     (define root car)

     (define left-subtree cadr)

     (define right-subtree caddr)
previous | index | next