Data Structures & Algorithms in Python

Trees, Heaps & Graphs

30 min9 activities0 complete

1 of 9

Explore the idea

Binary Trees: Structure & Traversals

Opening your lesson…

Opening your space…

IN THIS LESSON

YOU’RE LEARNING TO

↗traverse a binary tree using in-order, pre-order, and post-order traversal

↗use heapq to implement a min-heap and a priority queue

↗represent a graph as an adjacency dictionary

↗implement BFS and DFS on a graph

↗explain how Python dict and set use hashing and why average lookups are O(1)