Learn Advanced Data Structures with Python: Trees
Offered By: Codecademy
Course Description
Overview
Learn how to use tries and binary indexed trees for efficient search implementations.
Continue your Python 3 learning journey with Learn Advanced Data Structures with Python: Trees. Learn how to use prefix trees, or tries for short, tree-like data structures in which each node contains links to nodes representing characters. Then learn how to use binary index trees to compute an accumulation in O(logn) time.
### Notes on Prerequisites
We recommend that you complete [Learn Advanced Algorithms with Python: String Searching Algorithms](https://www.codecademy.com/learn/learn-advanced-algorithms-with-python-string-searching-algorithms) before completing this course.
Continue your Python 3 learning journey with Learn Advanced Data Structures with Python: Trees. Learn how to use prefix trees, or tries for short, tree-like data structures in which each node contains links to nodes representing characters. Then learn how to use binary index trees to compute an accumulation in O(logn) time.
### Notes on Prerequisites
We recommend that you complete [Learn Advanced Algorithms with Python: String Searching Algorithms](https://www.codecademy.com/learn/learn-advanced-algorithms-with-python-string-searching-algorithms) before completing this course.
Syllabus
- Trees: Learn about tries and binary indexed trees for efficient search implementations!
- Article: Introduction to Tries
- Lesson: Implementing Tries in Python
- Quiz: Tries
- Article: Introduction to Binary Indexed Trees
- Lesson: Implementing Binary Indexed Trees in Python
- Quiz: Binary Indexed Trees
- Informational: Next Steps
Taught by
Jace van Auken
Related Courses
Design of Computer ProgramsStanford University via Udacity Algorithms, Part I
Princeton University via Coursera Algorithms, Part II
Princeton University via Coursera Intro to Algorithms
Udacity Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera