Python postorder_rec Examples

Example #1

File: test_tree.py Project: lnfvictor/sg-pygame

 def test_postorder(self):
     n1 = Node(100)
     n2 = Node(50)
     n3 = Node(150)
     n4 = Node(25)
     n5 = Node(75)
     n6 = Node(125)
     n7 = Node(175)
     n1.left, n1.right = n2, n3
     n2.left, n2.right = n4, n5
     n3.left, n3.right = n6, n7
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder(n1))
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder_rec(n1))

Example #2

File: test_tree.py Project: Danawill/algorithms

 def test_postorder(self):
     n1 = Node(100)
     n2 = Node(50)
     n3 = Node(150)
     n4 = Node(25)
     n5 = Node(75)
     n6 = Node(125)
     n7 = Node(175)
     n1.left, n1.right = n2, n3
     n2.left, n2.right = n4, n5
     n3.left, n3.right = n6, n7
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder(n1))
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder_rec(n1))

Example #3

File: test_tree.py Project: Web-Dev-Collaborative/DS-ALGO-OFFICIAL

 def test_postorder(self):
     tree = create_tree()
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder(tree))
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder_rec(tree))

Example #4

File: test_tree.py Project: achapkowski/algorithms

 def test_postorder(self):
     tree = create_tree()
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder(tree))
     self.assertEqual([25, 75, 50, 125, 175, 150, 100], postorder_rec(tree))