WORK ON THE HEIGHT FUNCTION USING PYTHON LANGUAGE

class Tree: """A recursive tree data structure. Note the relationship between this class and RecursiveList; the onLy major difference is that_rest has been replaced bysubtrees to handLe multiple recursive sub-parts. # === Private Attributes # The Item stored at this tree's root, or None if the tree is empty. root Optional[Anyl # The List of aLL subtrees of this tree. subtrees: ListlTree] # === Representation Invarants # -If self.-root is None then self .-subtrees is an empty List. # This setting of ttributes represents an empty Tree Note: self-subtrees may be empty when self-root s not None. This setting of attributes represents a tree consisting of just one node # # def init_(self, root Any, subtrees: List[Tree]) None: """Initialize a new Tree with the given root value and subtrees. If is None, the tree is empty. Precondition: f s None, then >> t1Tree (17, []) >>> t1.height() >>t2Tree(1, [Tree(-2, []), Tree(1e, [ >>>t2.height () 2 Tree(-3e, [1)]) # if self.is-empty() # elif self-subtrees == []: # etse; #for subtree in self._subtrees: .. subtree.height()