btree_2.rkt

(define (bst-insert e bst)
  (cond
    [(t-empty? bst) (t-node e t-empty t-empty)]
    [(< e (t-value bst))
     (t-node
       (t-value bst)
       (bst-insert e (t-left bst))
       (t-right bst))]
    [else
      (t-node
        (t-value bst)
        (t-left bst)
        (bst-insert e (t-right bst)))] ))

(print (bst-insert 4 my-tree))