W3Schools Tryit Editor

class TreeNode:
    def __init__(self, data):
        self.data = data
        self.left = None
        self.right = None

def inOrderTraversal(node):
    if node is None:
        return
    inOrderTraversal(node.left)
    print(node.data, end=", ")
    inOrderTraversal(node.right)

def minValueNode(node):
    current = node
    while current.left is not None:
        current = current.left
    return current

def delete(node, data):
    if not node:
        return None

if data < node.data:
        node.left = delete(node.left, data)
    elif data > node.data:
        node.right = delete(node.right, data)
    else:
        # Node with only one child or no child
        if not node.left:
            temp = node.right
            node = None
            return temp
        elif not node.right:
            temp = node.left
            node = None
            return temp

# Node with two children, get the in-order successor
        node.data = minValueNode(node.right).data
        node.right = delete(node.right, node.data)

return node

root = TreeNode(13)
node7 = TreeNode(7)
node15 = TreeNode(15)
node3 = TreeNode(3)
node8 = TreeNode(8)
node14 = TreeNode(14)
node19 = TreeNode(19)
node18 = TreeNode(18)

root.left = node7
root.right = node15

node7.left = node3
node7.right = node8

node15.left = node14
node15.right = node19

node19.left = node18

# Traverse
inOrderTraversal(root)

# Delete node 15
delete(root,15)

# Traverse
print() # Creates a new line
inOrderTraversal(root)

​x
 
class TreeNode:    def __init__(self, data):        self.data = data        self.left = None        self.right = None​def inOrderTraversal(node):    if node is None:        return    inOrderTraversal(node.left)    print(node.data, end=", ")    inOrderTraversal(node.right)​def minValueNode(node):    current = node    while current.left is not None:        current = current.left    return current​def delete(node, data):    if not node:        return None​    if data < node.data:        node.left = delete(node.left, data)    elif data > node.data:        node.right = delete(node.right, data)    else:        # Node with only one child or no child        if not node.left:            temp = node.right            node = None            return temp        elif not node.right:            temp = node.left            node = None            return temp​        # Node with two children, get the in-order successor        node.data = minValueNode(node.right).data        node.right = delete(node.right, node.data)​    return node​root = TreeNode(13)node7 = TreeNode(7)node15 = TreeNode(15)