Data Structures - Check if Tree is Binary Search Tree

Why do the binary tree exercises say that left <= parent && right >= parent. How do binary trees remain predictable if left and right can both hold the same value as the parent. For that matter why can they share a value at all??

Do these exercises just not show that, cause right now they seem flawed?

Challenge: Data Structures - Check if Tree is Binary Search Tree

Link to the challenge:

I hope this might help you https://stackoverflow.com/questions/300935/are-duplicate-keys-allowed-in-the-definition-of-binary-search-trees

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.