# Data Structures & Algorithms in Python: Implementing Trees & Graphs

Python    |    Beginner
• 14 videos | 1h 25m 50s
• Includes Assessment
Rating 4.6 of 80 users (80)
Explore implementing trees and graphs in Python in this 14-video, hands-on course that contains only labs. In this course, learners will use Python 3 and Jupyter Notebooks as their IDE (integrated development environment). In the course labs, you will implement a binary search, define a binary search tree, and use code functions to work with those data structures. Next, you will implement algorithms to traverse trees, including how to perform a breadth-first traversal and depth-first traversal of the tree. Continue by examining graph data structure, and implementing different representations of graphs in Python by using an abstract class for a graph to represent graphs as both an adjacency set and an adjacency matrix. You will implement algorithms to traverse such graphs, including a breadth-first traversal and a depth-first traversal. This course then demonstrates how to run a test to check its implementation. Finally, learners observe how to implement a topological sort for a specific type of graph which is both directed as well as acyclic.

## WHAT YOU WILL LEARN

• Discover the key concepts covered in this course
Code a function to perform a binary search on a sorted array of elements
Define the classes and functions required to implement a binary search tree
Create functions to perform common bst operations such as lookup and finding the minimum and maximum values
Write a function to perform a breadth first traversal of a bst
Code functions to perform pre-order, in-order, and post-order traversals of a bst
Define an abstract base class for a graph implementation and a vertex class with an adjacency set
• Implement an adjacency set representation for a graph
Build a graph represented as an adjacency set and test out the functions defined to work with it
Define a class to represent a graph in the form of an adjacency matrix
Code a function to perform a breadth first traversal of a graph
Write a function to traverse a graph in a depth first manner
Implement a topological sort of a directed acyclic graph
List the three different forms of depth first traversal of a binary tree and describe the topological sort algorithm for a graph

## IN THIS COURSE

• During this video, you will learn how to code a function to perform a binary search on a sorted array of elements.
• 3.  Defining a Binary Search Tree
In this video, you will learn how to define the classes and functions required to implement a binary search tree.
• 4.  Common Operations on a BST
In this video, find out how to create functions to perform common BST operations such as lookup, finding the minimum and maximum values.
• 5.  Breadth First Traversal of a BST
In this video, find out how to write a function to perform a breadth first traversal of a binary search tree.
• 6.  Depth First Traversal of a BST
In this video, you will code functions to perform pre-order, in-order, and post-order traversals of a binary search tree.
• 7.  Graphs: The Building Blocks
Learn how to define an abstract base class for a graph implementation and a vertex class with an adjacency list.
• 8.  Graphs: The Adjacency Set Representation
In this video, learn how to implement a graph using an adjacency set representation.
• 9.  Graphs: Testing the Adjacency Set
In this video, you will build a graph represented as an adjacency set and test out the functions you have defined to work with it.
• 10.  Graphs: The Adjacency Matrix
In this video, you will learn how to create a class to represent a graph using an adjacency matrix.
• 11.  Graphs: A Breadth First Traversal
Find out how to code a function to perform a breadth-first traversal of a graph.
• 12.  Graphs: A Depth First Traversal
In this video, learn how to write a function to traverse a graph in a depth-first manner.
• 13.  Graphs: The Topological Sort
In this video, learn how to implement a topological sort of a directed graph with no cycles.
• 14.  Exercise: Implementing Trees and Graphs in Python
After completing this video, you will be able to list the three different forms of depth first traversal of a binary tree and describe the Topological Sort algorithm for a graph.

## EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

## YOU MIGHT ALSO LIKE

Rating 4.6 of 16 users (16)
Rating 4.0 of 1 users (1)

## PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.5 of 149 users (149)
Rating 4.5 of 113 users (113)
Rating 4.6 of 52 users (52)