       true)))
 
 (defn naive-balanced?
-  [tree]
-  (let [t (.tree tree)]
+  [t]
     (if (ram-empty? t)
       true
       ;; check heights recursively

  (let [t (.tree tree)]
    (and (not (or (violates-red-invariant? t)
                  (violates-black-invariant? t)))
         (naive-balanced? tree))))

(defn i [a b]
  (assoc a (keyword (str b)) b))

(defn r [a b]
  (dissoc a (keyword (str b))))

             (<= lh (+ (* 2 rh) 1))
             true))
         (naive-balanced? l)
         (naive-balanced? r)))))

(defn balanced?
  "Determines if a red-black tree is balanced"
