Tree is in order. Traverse down the tree to get sorted values using inorder traversal. Inorder traversal is useful to determine if a tree is a binary search tree. Code is in python. Done through recursion.
It is a well-known fact that all human beings are different and unique in their ways. However, no matter how unique and different we are from one another, one thing which remains the same between all of us is our innate nature to commit mistakes.