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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!