def setUp(self) -> None:
self.mock_tree = BinaryTree.Tree()
self.mock_tree.insert(2)
self.mock_tree.insert(6)
self.mock_tree.insert(0)
self.mock_tree.insert(7)
self.mock_tree.insert(5)
def testFind(self):
t = BinaryTree.Tree()
t.add(7)
node = BinaryTree.Node(7)
self.assertEqual(t.find(7).Value(), node.Value())
#impliment a function to check if a tree is balanced #balanced means that there's never a height difference of more than one between two subtrees import BinaryTree BT = BinaryTree.Tree() BT.add(0) BT.add(1) BT.add(2) BT.add(4) #
def testIsEmpty(self):
t = BinaryTree.Tree()
self.assertEqual(t.IsEmpty(), True)
