A binary search tree is a special instance of a graph. Describe (no code) an algorithm that takes a binary search tree as input and produces an adjacency list, which represents it as an undirected graph.