Trees & Graphs

Learning Objectives

• Traverse trees using in-order, pre-order, and post-order techniques.
• Implement a Binary Search Tree (BST) for efficient data lookup.
• Distinguish between directed, undirected, and weighted graphs.

Core Topics

Practical Exercise

Build a Binary Search Tree that inserts a list of random integers, then write a function that prints them in sorted order using in-order traversal.

Recommended Learning Resources