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.
