def test(self):
solution = Solution()
self.assertEqual(
solution.isUnivalTree(listToTreeNode([1, 1, 1, 1, 1, None, 1])),
True)
self.assertEqual(
solution.isUnivalTree(listToTreeNode([2, 2, 2, 5, 2])), False)
def test(self):
solution = Solution()
self.assertEqual(treeNodeToList(solution.subtreeWithAllDeepest(
listToTreeNode([3, 5, 1, 6, 2, 0, 8, None, None, 7, 4])
)), [2, 7, 4])
self.assertEqual(treeNodeToList(solution.subtreeWithAllDeepest(
listToTreeNode([0, 2, 1, None, None, 3])
)), [1, 3])
def test(self):
solution = Solution()
self.assertEqual(
solution.maxAncestorDiff(
listToTreeNode(
[8, 3, 10, 1, 6, None, 14, None, None, 4, 7, 13])), 7)
self.assertEqual(
solution.maxAncestorDiff(listToTreeNode([2, None, 0, 1])), 2)
def test(self):
solution = Solution()
self.assertEqual(
solution.flipEquiv(
listToTreeNode([1, 2, 3, 4, 5, 6, None, None, None, 7, 8]),
listToTreeNode(
[1, 3, 2, None, 6, 4, 5, None, None, None, None, 8, 7]),
), True)
def test(self):
solution = Solution()
self.assertEqual(
solution.rangeSumBST(listToTreeNode([10, 5, 15, 3, 7, None, 18]),
7, 15), 32)
self.assertEqual(
solution.rangeSumBST(
listToTreeNode([10, 5, 15, 3, 7, 13, 18, 1, None, 6]), 6, 10),
23)
def test(self):
obj1 = CBTInserter(listToTreeNode([1]))
self.assertEqual(obj1.insert(2), 1)
self.assertEqual(treeNodeToList(obj1.get_root()), [1, 2])
obj2 = CBTInserter(listToTreeNode([1, 2, 3, 4, 5, 6]))
self.assertEqual(obj2.insert(7), 3)
self.assertEqual(obj2.insert(8), 4)
self.assertEqual(treeNodeToList(obj2.get_root()),
[1, 2, 3, 4, 5, 6, 7, 8])
def test(self):
solution = Solution()
self.assertEqual(solution.distributeCoins(listToTreeNode([3, 0, 0])),
2)
self.assertEqual(solution.distributeCoins(listToTreeNode([0, 3, 0])),
3)
self.assertEqual(solution.distributeCoins(listToTreeNode([1, 0, 2])),
2)
self.assertEqual(
solution.distributeCoins(listToTreeNode([1, 0, 0, None, 3])), 4)
def test(self):
solution = Solution()
self.assertEqual(
treeNodeToList(
solution.increasingBST(
listToTreeNode(
[5, 3, 6, 2, 4, None, 8, 1, None, None, None, 7, 9]))),
treeNodeToList(
listToTreeNode([
1, None, 2, None, 3, None, 4, None, 5, None, 6, None, 7,
None, 8, None, 9
])))
def test(self):
solution = Solution()
self.assertEqual(
treeNodeToList(
solution.insertIntoMaxTree(
listToTreeNode([4, 1, 3, None, None, 2]), 5)),
[5, 4, None, 1, 3, None, None, 2])
self.assertEqual(
treeNodeToList(
solution.insertIntoMaxTree(listToTreeNode([5, 2, 4, None, 1]),
3)), [5, 2, 4, None, 1, None, 3])
self.assertEqual(
treeNodeToList(
solution.insertIntoMaxTree(listToTreeNode([5, 2, 3, None, 1]),
4)), [5, 2, 4, None, 1, 3])
def test(self):
solution = Solution()
self.assertEqual(
treeNodeToList(
solution.bstToGst(
listToTreeNode([
4, 1, 6, 0, 2, 5, 7, None, None, None, 3, None, None,
None, 8
]))), [
30, 36, 21, 36, 35, 26, 15, None, None, None, 33, None,
None, None, 8
])
def test(self):
solution = Solution()
self.assertEqual(
treeNodeToList(
solution.searchBST(listToTreeNode([4, 2, 7, 1, 3]), 2)),
[2, 1, 3])