Design a Binary tree of your choice and Traverse it.

In the binary search tree, write a function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p: Node):

what is the minimum number of nodes in a complete binary tree of 8?

The maximum number of nodes that a binary tree of height 8 can have is 127. Is this statement true of false?  Explain why its true or false.