Question
PYTHON 3 PLEASE FOLLOW INSTRUCTIONS COMPLETE CODE Problem : Complete the function isValidBST() to take in a root node of a binary tree and return
PYTHON 3 PLEASE FOLLOW INSTRUCTIONS
COMPLETE CODE
Problem : Complete the function isValidBST() to take in a root node of a binary tree and return True if the tree is a valid BST, False otherwise.
CODE :
class Node: def __init__(self, value): self.value = value self.left = None self.right = None def isValidBST(root): # todo
root = Node(7) # left sub root.left = Node(4) root.left.left = Node(1) root.left.right = Node(5) # right sub root.right = Node(10) root.right.right = Node(13) """ 7 / \ 4 10 / \ \ 1 5 13 """
isValidBST(root) #must return True root.value = 3 isValidBST(root) #must return False
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started