def test_solution(self):
for nums, answer in self.test_case:
ans = self.s.constructMaximumBinaryTree(nums)
self.assertEqual(answer, TreeNode.literal(ans))
def test_solution(self):
for nums, answer in self.test_case:
root = TreeNode.create(nums)
ans = self.s.convertBST(root)
self.assertEqual(TreeNode.literal(ans), answer)
def test_solution(self):
for nums, answer in self.test_case:
root = TreeNode.create(nums)
ans = self.s.pruneTree(root)
self.assertEqual(answer, TreeNode.literal(ans))
def test_solution(self):
for nums, val, answer in self.test_case:
root = TreeNode.create(nums)
ans = self.s.insertIntoBST(root, val)
self.assertEqual(answer, TreeNode.literal(ans))
