Here is a Python program that creates a Binary Search Tree (BST) and performs an inorder traversal:

```python
class Node:
def __init__(self, key):
self.left = None
self.right = None
self.val = key

def insert(root, key):
if root is None:
return Node(key)
else:
if root.val

Question

Here is a Python program that creates a Binary Search Tree (BST) and performs an inorder traversal:

```python
class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

def insert(root, key):
    if root is None:
        return Node(key)
    else:
        if root.val < key:
            root.right = insert(root.right, key)
        else:
            root.left = insert(root.left, key)
    return root

def inorder(root):
    if root:
        inorder(root.left)
        print(root.val),
        inorder(root.right)

r = Node(50)
r = insert(r, 30)
r = insert(r, 20)
r = insert(r, 40)
r = insert(r, 70)

print("Inorder traversal of the given tree is:")
inorder(r)
```

This program first creates a root node with value 50. Then it inserts 30, 20, 40, and 70 into the tree. Finally, it prints the inorder traversal of the tree.

Please note that this program does not take user input. If you want to take user input, you can modify the program as follows:

```python
class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

def insert(root, key):
    if root is None:
        return Node(key)
    else:
        if root.val < key:
            root.right = insert(root.right, key)
        else:
            root.left = insert(root.left, key)
    return root

def inorder(root):
    if root:
        inorder(root.left)
        print(root.val),
        inorder(root.right)

r = Node(int(input("Enter root node value: ")))
while True:
    val = int(input("Enter value to insert (-1 to stop): "))
    if val == -1:
        break
    else:
        r = insert(r, val)

print("Inorder traversal of the given tree is:")
inorder(r)
```

This program first asks the user to enter the root node value. Then it repeatedly asks the user to enter a value to insert into the tree until the user enters -1. Finally, it prints the inorder traversal of the tree.

Knowee AI · Accepted Answer