How can I visualize a binary search tree in Python?

How can I visualize a binary search tree in Python?

You can use libraries like Matplotlib or Graphviz to visualize a binary search tree. Would you like a code example?

Yes, please provide a code example using Matplotlib.

Here's a simple example:

import matplotlib.pyplot as plt
import networkx as nx

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

# Function to visualize the BST

def visualize_bst(root):
    G = nx.DiGraph()
    def add_edges(node):
        if node:
            if node.left:
                G.add_edge(node.val, node.left.val)
                add_edges(node.left)
            if node.right:
                G.add_edge(node.val, node.right.val)
                add_edges(node.right)
    add_edges(root)
    pos = nx.spring_layout(G)
    nx.draw(G, pos, with_labels=True, arrows=True)
    plt.show()

# Example usage
root = None
keys = [7, 3, 9, 1, 5, 8, 10]
for key in keys:
    root = insert(root, key)
visualize_bst(root)

This is great! Can you explain how the visualization works?

Sure! The code uses NetworkX to create a directed graph of the BST. Each node is added as a vertex, and edges represent parent-child relationships. Matplotlib then visualizes this graph.