Hi, I had a question about Python. I am programming a binary search tree. You can use Java or C++ if someone does not now Python. The problem is that I am having troubling printing out the binary search tree  diagram.  Here is my code below:  class BSTNode: def __init__(node, value): node.value = value node.leftChild = None node.rightChild = None # Insertion code # No duplicates. # Start of of the insert definition def insert(node, value): if node == node.value: return elif value < node.value: elif node.rightChild: node.rightChild.insert(value) else: node.rightChild = BSTNode(value) else: if node.leftChild: node.leftChild.insert(value) else: node.leftChild = BSTNode(value) node_elements = [100, 66, 120, 76, 34, 27, 90, 45, 76, 89, 15, 7,15, 60, 43, 99,27, 16, 13, 150] root = BSTNode(node_elements[0]) for i in range(1, len(node_elements)): root.insert(node_elements[i])   Questions:  What code is needed to print the binary search tree module? You can correct my code and tell me what's wrong. I am having so much trouble printing the diagram out. I want it to be in a search tree diagram with the roots and nodes.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

Hi, I had a question about Python. I am programming a binary search tree. You can use Java or C++ if someone does not now Python. The problem is that I am having troubling printing out the binary search tree  diagram. 

Here is my code below: 

class BSTNode:

def __init__(node, value):
node.value = value
node.leftChild = None
node.rightChild = None

# Insertion code
# No duplicates.
# Start of of the insert definition

def insert(node, value):
if node == node.value:
return
elif value < node.value:
elif node.rightChild:
node.rightChild.insert(value)
else:
node.rightChild = BSTNode(value)
else:
if node.leftChild:
node.leftChild.insert(value)
else:
node.leftChild = BSTNode(value)


node_elements = [100, 66, 120, 76, 34, 27, 90, 45, 76, 89, 15, 7,15, 60, 43, 99,27, 16, 13, 150]
root = BSTNode(node_elements[0])
for i in range(1, len(node_elements)):
root.insert(node_elements[i])

 

Questions: 

What code is needed to print the binary search tree module? You can correct my code and tell me what's wrong. I am having so much trouble printing the diagram out. I want it to be in a search tree diagram with the roots and nodes. 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education