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.
@LinhTy i looked into your last submission and it looks like your logic is wrong. May be you could think of how to solve it. The left child of the root should be less than the root value and right child of root should be greater than the root value. If you do this, there are still some conditions to check for.
Trees: Is This a Binary Search Tree?
You are viewing a single comment's thread. Return to all comments →
@LinhTy i looked into your last submission and it looks like your logic is wrong. May be you could think of how to solve it. The left child of the root should be less than the root value and right child of root should be greater than the root value. If you do this, there are still some conditions to check for.