Solving Validate Binary Search Tree in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Given a binary tree, determine if it is a valid binary search tree (BST).

Assume a BST is defined as follows:

  • Both the left and right subtrees must also be binary search trees.

xample 1:

    2
   / \
  1   3

Input: [2,1,3]
Output: true

Example 2:

    5
   / \
  1   4
     / \
    3   6

Input: [5,1,4,null,null,3,6]
Output: false
Explanation: The root node's value is 5 but its right child's value is 4.

See the full details of the problem Validate Binary Search Tree at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go