splitR :: (Sized a) => Node a -> Breadth -> (Node a, Node a)
splitR (Node s n) b =
  case splitNode n b of
    (d, r) -> (node (V.force d), node r)

-- Split for L, counting from right, copying right

splitR :: (Sized a) => Node a -> Breadth -> (Node a, Node a)
splitR (Node s n) b =
  case splitNode n b of
    (d, r) -> (node (V.force d), node r)

-- Split for L, counting from right, copying right

splitR (Node s n) b =
  case splitNode n b of
    (d, r) -> (node (V.force d), node r)

-- Split for L, counting from right, copying right
