Is BT a BST dought in concept

#1

for BT to be a BST the left child should be smaller then parent and right should be greater.
25<-50->75

12<-25->37

35<-75->87

END<-12->END

END<-37->END

END<-35->END

END<-87->END

is this a binary search tree i am asking this because bhaiya only said that lest child should be less then parent and right child should be greater then parent but here the left child of 75 is also then the root node.
so while inorder traversal we will not get sorted arraylist but acc.to the concept of first it should be BST(Bhaiya didnt mentioned anywhere that the left child of right should be lesser then root also.

#2

I think you are a bit confused regarding BST. So here is the most accurate definition(from GFG):-

Binary Search Tree is a node-based binary tree data structure which has the following properties:

The left subtree of a node contains only nodes with keys lesser than the node’s key.
The right subtree of a node contains only nodes with keys greater than the node’s key.
The left and right subtree each must also be a binary search tree.

Now, for the question that you are asking, no this is not a BST since the root i.e. 50 is greater than one of the child of right subtree i.e. 35 while according to the definition all elements in the right subtree should be greater than the element as the root.