Added tests

pydatastructs/trees/tests/test_m_ary_trees.py

@@ -0,0 +1,5 @@
+from pydatastructs import MAryTree
+
+def test_MAryTree():
+    m = MAryTree(1, 1)
+    assert str(m) == '[(1, 1)]'

pydatastructs/utils/misc_util.py

@@ -148,6 +148,9 @@ def add_children(self, *children):
         for child in children:
             self.children.append(child)
 
+    def __str__(self):
+        return str((self.key, self.data))
+
 
 class LinkedListNode(Node):
     """

pydatastructs/utils/tests/test_misc_util.py

@@ -1,4 +1,5 @@
-from pydatastructs.utils import AdjacencyListGraphNode, AdjacencyMatrixGraphNode, GraphEdge
+from pydatastructs.utils import (AdjacencyListGraphNode, AdjacencyMatrixGraphNode,
+                                GraphEdge, BinomialTreeNode, MAryTreeNode)
 from pydatastructs.utils.raises_util import raises
 
 def test_AdjacencyListGraphNode():
@@ -25,3 +26,15 @@ def test_GraphEdge():
     g_2 = AdjacencyListGraphNode('g_2', 2)
     e = GraphEdge(g_1, g_2, value=2)
     assert str(e) == "('g_1', 'g_2')"
+
+def test_BinomialTreeNode():
+    b = BinomialTreeNode(1,1)
+    b.add_children(*[BinomialTreeNode(i,i) for i in range(2,10)])
+    assert str(b) == '(1, 1)'
+    assert str(b.children) == "['(2, 2)', '(3, 3)', '(4, 4)', '(5, 5)', '(6, 6)', '(7, 7)', '(8, 8)', '(9, 9)']"
+
+def test_MAryTreeNode():
+    m = MAryTreeNode(1, 1)
+    m.add_children(*[i for i in range(2,10)])
+    assert str(m) == "(1, 1)"
+    assert str(m.children) == "['2', '3', '4', '5', '6', '7', '8', '9']"