The question is asking to write a function to delete a node 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 minValueNode(node): current = node while(current.left is not None): current = current.left return current def deleteNode(root, key): if root is None: return root if key root.val): root.right = deleteNode(root.right, key) else: if root.left is None: return root.right elif root.right is None: return root.left root.val = minValueNode(root.right).val root.right = deleteNode(root.right, root.val) return root def inorder(root): if root: inorder(root.left) print(root.val), inorder(root.right) # Driver code root = Node(40) root.left = Node(20) root.right = Node(60) root.left.left = Node(10) root.left.right = Node(30) root.right.left = Node(50) root.right.right = Node(70) root.left.left.left = Node(5) root.left.left.right = Node(15) root.left.right.left = Node(25) root.left.right.right = Node(35) root.right.left.left = Node(45) root.right.left.right = Node(55) root.right.right.left = Node(65) root.right.right.right = Node(75) print("Inorder traversal of the given tree") inorder(root) print(" Delete 60") root = deleteNode(root, 60) print("Inorder traversal of the modified tree") inorder(root) ``` This code first creates a BST with the given nodes. Then it deletes the node with value 60 and prints the inorder traversal of the modified tree. The deleteNode function works by searching for the node to be deleted, replacing it with the inorder successor if it has two children, and adjusting the links to maintain the BST property.

Question

The question is asking to write a function to delete a node 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 minValueNode(node):
    current = node
    while(current.left is not None):
        current = current.left
    return current

def deleteNode(root, key):
    if root is None:
        return root
    if key < root.val:
        root.left = deleteNode(root.left, key)
    elif(key > root.val):
        root.right = deleteNode(root.right, key)
    else:
        if root.left is None:
            return root.right
        elif root.right is None:
            return root.left
        root.val = minValueNode(root.right).val
        root.right = deleteNode(root.right, root.val)
    return root

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

# Driver code
root = Node(40)
root.left = Node(20)
root.right = Node(60)
root.left.left = Node(10)
root.left.right = Node(30)
root.right.left = Node(50)
root.right.right = Node(70)
root.left.left.left = Node(5)
root.left.left.right = Node(15)
root.left.right.left = Node(25)
root.left.right.right = Node(35)
root.right.left.left = Node(45)
root.right.left.right = Node(55)
root.right.right.left = Node(65)
root.right.right.right = Node(75)

print("Inorder traversal of the given tree")
inorder(root)

print("
Delete 60")
root = deleteNode(root, 60)

print("Inorder traversal of the modified tree")
inorder(root)
```

This code first creates a BST with the given nodes. Then it deletes the node with value 60 and prints the inorder traversal of the modified tree. The deleteNode function works by searching for the node to be deleted, replacing it with the inorder successor if it has two children, and adjusting the links to maintain the BST property.

Knowee AI · Accepted Answer