Step 3 :Do a Inorder traversal of tree by travesring left subtree,root and right subtree in order.

Step 4 :While doing Inorder traversal check if the current node’s value is less than temp.If the current node value is less than temp then it is not binary search tree else assign temp to current node’s value and keep on doing Inorder traversal.

About the Author

Dear Friends,
I am A.K.M. .This online journal ai1tutorial.com is a humble effort from my side to all students and professionals who want to learn computer science related technologies.I am not a professional blogger and I write posts in this blog only in my leisure time.I may not be 100% perfect in all my posts,but your review comments can surely help me to make it 100% perfect.