 (defn leaf-val [node] {:pre (is-leaf? node)} (second node))
 (defn lhs-node [node] {:pre (is-node? node)} (nth node 1))
 (defn rhs-node [node] {:pre (is-node? node)} (nth node 2))
+
+
+;; -----------------------------------------------------------
+;; Build the Huffman tree
+;; -----------------------------------------------------------
 
 (defn- merge-nodes-by-lowest-frequency
   "Build the huffman tree from the priority map"

  (prn (decode t [0 0 0 0 0 1 0 1 1 0 1 1]))
  )




    ))



;; -----------------------------------------------------------
;; Helpers to build a binary tree 
;; -----------------------------------------------------------

(defn make-leaf [value] [::leaf value])
