PYTHON PROGRAMMING ONLY (BINARY SEARCH TREE) MY CODE IS NOT WORKING PROPERLY (IM USING PYCHARM AS MY IDE) 1. Generate a random binary tree with 12 elements. You can leave the perfect option as False. 2. Print the tree. 3. Test the tree properties. The documentation uses the assert statement. 4. Create a binary search tree manually (not using the bst function, but instead building it by hand. Put at least 8 elements in it. 5. Print this tree. 6. Print the values in the tree in several orders (inorder, postorder, preorder, etc.) CODE BELOW from binarytree import build, bst, Node # Generate a random binary tree with 12 elements random_tree = build(height=3, min_value=1, max_value=100) # Print the tree print("Random binary tree:") print(random_tree) # Test the tree properties assert random_tree.is_binary_tree assert not random_tree.is_perfect # Create a binary search tree manually bst_tree = Node(50) bst_tree.left = Node(30) bst_tree.right = Node(70) bst_tree.left.left = Node(20) bst_tree.left.right = Node(40) bst_tree.right.left = Node(60) bst_tree.right.right = Node(80) bst_tree.right.right.right = Node(90) # Print the BST print("Binary search tree:") print(bst_tree) # Print the values in the tree in several orders print("Inorder traversal:") print(bst_tree.inorder) print("Postorder traversal:") print(bst_tree.postorder) print("Preorder traversal:") print(bst_tree.preorder)
PYTHON PROGRAMMING ONLY (BINARY SEARCH TREE)
MY CODE IS NOT WORKING PROPERLY
(IM USING PYCHARM AS MY IDE)
1. Generate a random binary tree with 12 elements. You can leave the perfect option as
False.
2. Print the tree.
3. Test the tree properties. The documentation uses the assert statement.
4. Create a binary search tree manually (not using the bst function, but instead building
it by hand. Put at least 8 elements in it.
5. Print this tree.
6. Print the values in the tree in several orders (inorder, postorder, preorder, etc.)
CODE BELOW
from binarytree import build, bst, Node
# Generate a random binary tree with 12 elements
random_tree = build(height=3, min_value=1, max_value=100)
# Print the tree
print("Random binary tree:")
print(random_tree)
# Test the tree properties
assert random_tree.is_binary_tree
assert not random_tree.is_perfect
# Create a binary search tree manually
bst_tree = Node(50)
bst_tree.left = Node(30)
bst_tree.right = Node(70)
bst_tree.left.left = Node(20)
bst_tree.left.right = Node(40)
bst_tree.right.left = Node(60)
bst_tree.right.right = Node(80)
bst_tree.right.right.right = Node(90)
# Print the BST
print("Binary search tree:")
print(bst_tree)
# Print the values in the tree in several orders
print("Inorder traversal:")
print(bst_tree.inorder)
print("Postorder traversal:")
print(bst_tree.postorder)
print("Preorder traversal:")
print(bst_tree.preorder)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 4 images
