Algorithms and Data Structures with Python

Practical Exercises for Chapter 6

For Chapter 6, we have prepared a series of practical exercises. These activities are designed to deepen your understanding of tree and graph data structures, providing hands-on experience in implementing and grasping their key concepts.

Exercise 1: Implement a Binary Search Tree

• Create a basic Binary Search Tree (BST) with methods for insertion and in-order traversal.
• Insert the numbers 10, 5, 15, 2, 5, 13, 22, 1, 14 and then perform an in-order traversal.

Solution:

class Node:

def __init__(self, value):

self.value = value

self.left = None

self.right = None

 

class BinarySearchTree:

def __init__(self):

self.root = None

 

def insert(self, value):

new_node = Node(value)

if self.root is None:

self.root = new_node ...