Write a class called GoodTree in python that does the following.

root: the root of the tree structure is maintained by the class and GoodNode or none

__init__(self)

make this set the root attribute to None

then add

insert(self,node,dir=0)

this should find a place for node in the tree and add it as a child of the already existing node

finally add

depth(self)

which should return the length of the longest path in the tree that starts at self.root