The question is asking to write a code snippet that will find the minimum and maximum values in a binary search tree (BST). Here is a Python solution:

```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

The question is asking to write a code snippet that will find the minimum and maximum values in a binary search tree (BST). Here is a Python solution:

```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 minValue(node):
    current = node
    while(current.left is not None):
        current = current.left
    return current.val

def maxValue(node):
    current = node
    while(current.right is not None):
        current = current.right
    return current.val

r = Node(40)
r = insert(r, 20)
r = insert(r, 60)
r = insert(r, 10)
r = insert(r, 30)
r = insert(r, 50)
r = insert(r, 70)
r = insert(r, 5)
r = insert(r, 15)
r = insert(r, 25)
r = insert(r, 35)
r = insert(r, 45)
r = insert(r, 55)
r = insert(r, 65)
r = insert(r, 75)

print("Minimum value is : ", minValue(r))
print("Maximum value is : ", maxValue(r))
```

This Python code first defines a Node class for the BST, and then defines functions to insert nodes into the tree, and to find the minimum and maximum values. The minimum value is found by traversing the tree to the left as far as possible, and the maximum value is found by traversing to the right as far as possible. The code then creates a BST and inserts the given values, and finally prints the minimum and maximum values.

Knowee AI · Accepted Answer