We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Text in a problem description: "A binary tree is not a binary search if there are duplicate values"
Text in 'Binary Trees and Binary Search Trees' link: "Each element in the left subtree of t is less than or equal to the root element".
Which one is correct?
Trees: Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
Text in a problem description: "A binary tree is not a binary search if there are duplicate values" Text in 'Binary Trees and Binary Search Trees' link: "Each element in the left subtree of t is less than or equal to the root element". Which one is correct?