def binary_search_tree():
tree = Tree(100)
tree.left = Tree(50)
tree.left.left = Tree(25)
tree.left.rite = Tree(75)
tree.rite = Tree(150)
tree.rite.left = Tree(125)
tree.rite.rite = Tree(175)
return tree
def invalid_binary_search_tree():
tree = Tree(100)
tree.left = Tree(10)
tree.left.left = Tree(25)
tree.left.rite = Tree(75)
tree.rite = Tree(200)
tree.rite.left = Tree(125)
tree.rite.rite = Tree(175)
return tree
def full_skewed_tree():
tree = Tree(10)
tree.rite = Tree(20)
tree.rite.rite = Tree(30)
tree.rite.rite.rite = Tree(40)
tree.rite.rite.rite.rite = Tree(50)
tree.rite.rite.rite.rite.rite = Tree(60)
return tree
def height_imbalanced_tree():
tree = Tree(100)
tree.left = Tree(50)
tree.left.left = Tree(25)
tree.left.rite = Tree(75)
return tree
def subtree():
tree = Tree(50, Tree(25), Tree(75))
return tree