<html><head><style type="text/css"><!-- DIV {margin:0px;} --></style></head><body><div style="font-family:arial,helvetica,sans-serif;font-size:12pt"><div style="font-family: arial,helvetica,sans-serif; font-size: 12pt;">Hi,<br>I have been trying to specify the depth-first numbering algorithm as follow:<br><br>>_dfNum :: Int -> [Tree a] -> [Tree Int]<br>>_dfNum i ((Node n ts):us) = (Node i vs):(_dfNum (i+1+(length ts)) us) where<br>> vs=_dfNum (i+1) ts<br><br>But when I test it, I receive the message:<br><br>Non-exhaustive patterns in function _bfNum<br><br>Please, could you give me an idea of how I could fix this?<br>Thanks<br><br><br><div> </div><span style="font-weight: bold; color: rgb(0, 64, 127);"><span style="font-style: italic;"></span></span></div><div> </div><span style="font-weight: bold; color: rgb(0, 64, 127);"><span style="font-style:
italic;">Kind regards</span>,</span><br style="color: rgb(0, 64, 127);"><br style="color: rgb(0, 64, 127);"><span style="color: rgb(0, 64, 127); font-weight: bold; font-style: italic;">Ayawoa Sitsopé Dagbovie</span><br><span style="font-weight: bold; color: rgb(0, 64, 127);">African Institute for Mathematical Sciences</span><br style="font-weight: bold; color: rgb(0, 64, 127);"><span style="font-weight: bold; color: rgb(0, 64, 127);">#6 Melrose Road</span><br style="font-weight: bold; color: rgb(0, 64, 127);"><span style="font-weight: bold; color: rgb(0, 64, 127);">Muizenberg 7945</span><br style="font-weight: bold; color: rgb(0, 64, 127);"><span style="font-weight: bold; color: rgb(0, 64, 127);">South Africa.</span><br style="color: rgb(0, 64, 127);"><br><span style="color: rgb(0, 64, 127);">Phone:</span> <span style="color: rgb(255, 0, 0);">+27 782 960453</span><div><br></div></div><br>
</body></html>