Validate Binary Search Tree

project_name = 'pythondsa_project_validateBST' # give it an appropriate name

import jovian

jovian.commit(project=project_name)

[jovian] Updating notebook "minpyae365/pythondsa-project-validatebst" on https://jovian.ai/
[jovian] Committed successfully! https://jovian.ai/minpyae365/pythondsa-project-validatebst

'https://jovian.ai/minpyae365/pythondsa-project-validatebst'

Problem Statement

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

A valid BST is defined as follows:

The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Both the left and right subtrees must also be binary search trees.

Source: https://leetcode.com/problems/validate-binary-search-tree/