98. Validate Binary Search Tree

[arihant-dev]

Given a binary tree root, return whether it's a binary search tree. A binary tree node is a binary search tree if : ------(C++)

1. All nodes on its left subtree are smaller than node.val
2. All nodes on its right subtree are bigger than node.val
3. All nodes hold the these properties.

Constraint: n ≤ 100,000 where n is the number of nodes in root

[leninmeher]

Please assign me this problem.

[thepiyushway]

@leninmeher @arihantthriwe Which Language guys?

[leninmeher]

C++

[thepiyushway]

@leninmeher Assigned in C++

[arihant-dev]

C

[leninmeher]

Should i create a new branch...??

[thepiyushway]

@arihantthriwe I'll assign this to you in C, but now this repo has been excluded from Hacktoberfest 2021, please read the pinned issue of this repo to know more :')

[thepiyushway]

@arihantthriwe I'll assign this to you in C, but now this repo has been excluded from Hacktoberfest 2021, please read the pinned issue of this repo to know more :')