Rename some files

Author: Abhijit Sarkar

README.md

@@ -135,11 +135,11 @@ P54A omitted; our tree representation will only allow well-formed trees.
 
 [P61](src/BinaryTree/P61.hs) (*) Count the leaves of a binary tree.
 
-[P61A](src/BinaryTree/P61a.hs) (*) Collect the leaves of a binary tree in a list.
+[P61A](src/BinaryTree/P61A.hs) (*) Collect the leaves of a binary tree in a list.
 
 [P62](src/BinaryTree/P62.hs) (*) Collect the internal nodes of a binary tree in a list.
 
-[P62B](src/BinaryTree/P62b.hs) (*) Collect the nodes at a given level in a list.
+[P62B](src/BinaryTree/P62B.hs) (*) Collect the nodes at a given level in a list.
 
 [P63](src/BinaryTree/P63.hs) (**) Construct a complete binary tree.
 
@@ -149,7 +149,7 @@ P54A omitted; our tree representation will only allow well-formed trees.
 
 [P66](src/BinaryTree/P66.hs) (***) Layout a binary tree (3).
 
-[P67A](src/BinaryTree/P67a.hs) (**) A string representation of binary trees.
+[P67A](src/BinaryTree/P67A.hs) (**) A string representation of binary trees.
 
 [P68](src/BinaryTree/P68.hs) (**) Preorder and inorder sequences of binary trees.
 
@@ -159,7 +159,7 @@ P54A omitted; our tree representation will only allow well-formed trees.
 
 P70B omitted; we can only create well-formed trees.
 
-[P70C](src/MultiwayTree/P70c.hs) (*) Count the nodes of a multiway tree.
+[P70C](src/MultiwayTree/P70C.hs) (*) Count the nodes of a multiway tree.
 
 [P70](src/MultiwayTree/P70.hs) (**) Tree construction from a node string.
 

ninety-nine-haskell.cabal

@@ -36,22 +36,22 @@ library
       Arithmetic.P44
       Arithmetic.P45
       BinaryTree.BinaryTree
-      BinaryTree.P54a
+      BinaryTree.P54A
       BinaryTree.P55
       BinaryTree.P56
       BinaryTree.P57
       BinaryTree.P58
       BinaryTree.P59
       BinaryTree.P60
       BinaryTree.P61
-      BinaryTree.P61a
+      BinaryTree.P61A
       BinaryTree.P62
-      BinaryTree.P62b
+      BinaryTree.P62B
       BinaryTree.P63
       BinaryTree.P64
       BinaryTree.P65
       BinaryTree.P66
-      BinaryTree.P67a
+      BinaryTree.P67A
       BinaryTree.P68
       BinaryTree.P69
       DList
@@ -125,8 +125,8 @@ library
       Monad.P79
       MultiwayTree.MultiwayTree
       MultiwayTree.P70
-      MultiwayTree.P70b
-      MultiwayTree.P70c
+      MultiwayTree.P70B
+      MultiwayTree.P70C
       MultiwayTree.P71
       MultiwayTree.P72
       MultiwayTree.P73
@@ -172,14 +172,14 @@ test-suite ninety-nine-test
       BinaryTree.P57Spec
       BinaryTree.P58Spec
       BinaryTree.P59Spec
-      BinaryTree.P61aSpec
+      BinaryTree.P61ASpec
       BinaryTree.P61Spec
-      BinaryTree.P62bSpec
+      BinaryTree.P62BSpec
       BinaryTree.P62Spec
       BinaryTree.P63Spec
       BinaryTree.P64Spec
       BinaryTree.P65Spec
-      BinaryTree.P67aSpec
+      BinaryTree.P67ASpec
       BinaryTree.P68Spec
       BinaryTree.P69Spec
       BinaryTree.Trees
@@ -238,7 +238,7 @@ test-suite ninety-nine-test
       Monad.P78Spec
       Monad.P79Spec
       MultiwayTree.GenMultiwayTree
-      MultiwayTree.P70cSpec
+      MultiwayTree.P70CSpec
       MultiwayTree.P70Spec
       MultiwayTree.P71Spec
       MultiwayTree.P72Spec

src/BinaryTree/P54a.hs

@@ -1,4 +1,4 @@
-module BinaryTree.P54a where
+module BinaryTree.P54A where
 
 -- Problem 54A: (*) Check whether a given term represents a binary tree.
 -- ANSWER: Creating an invalid tree is not possible in Haskell.

src/BinaryTree/P61a.hs

@@ -1,4 +1,4 @@
-module BinaryTree.P61a where
+module BinaryTree.P61A where
 
 import BinaryTree.BinaryTree (Tree (..))
 

src/BinaryTree/P62b.hs

@@ -1,4 +1,4 @@
-module BinaryTree.P62b where
+module BinaryTree.P62B where
 
 import BinaryTree.BinaryTree (Tree (..))
 

src/BinaryTree/P67a.hs

@@ -1,4 +1,4 @@
-module BinaryTree.P67a (stringToTree, treeToString) where
+module BinaryTree.P67A (stringToTree, treeToString) where
 
 import BinaryTree.BinaryTree (Tree (..))
 import Control.Applicative ((<|>))

src/MultiwayTree/P70b.hs

@@ -1,4 +1,4 @@
-module MultiwayTree.P70b where
+module MultiwayTree.P70B where
 
 -- Problem 70B: (*) Check whether a given term represents a multiway tree.
 -- ANSWER: Creating an invalid tree is not possible in Haskell.

src/MultiwayTree/P70c.hs

@@ -1,6 +1,6 @@
 {-# LANGUAGE DerivingStrategies #-}
 
-module MultiwayTree.P70c where
+module MultiwayTree.P70C where
 
 import MultiwayTree.MultiwayTree (Tree (..))
 

test/BinaryTree/P61aSpec.hs

@@ -1,6 +1,6 @@
-module BinaryTree.P61aSpec (spec) where
+module BinaryTree.P61ASpec (spec) where
 
-import BinaryTree.P61a
+import BinaryTree.P61A
 import BinaryTree.Trees
 import Test.Hspec
 

test/BinaryTree/P62bSpec.hs

@@ -1,6 +1,6 @@
-module BinaryTree.P62bSpec (spec) where
+module BinaryTree.P62BSpec (spec) where
 
-import BinaryTree.P62b
+import BinaryTree.P62B
 import BinaryTree.Trees
 import Test.Hspec