Hello all, I would like to know the binary search tree terminology exactly. I know the value which is less than its root node, it will come left side or vice-versa. but what if in the below example in the picture, 4 is left to its 12 but yet smaller than 11. is it a binary search tree?
Where did you find that graphic? What does it say about point B? Could this be a self-balanced binary tree? Still doesn’t make sense as searching for 4 would mean looking through > 11, which breaks the whole notion of a binary search
That can’t be a binary search tree because 4 is an invalid node. That’s just a binary tree. That graphic is wrong..