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.

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.