Suffix trees concept in Data Structures Theory - Mini Project: Build & Apply

Building a Simple Suffix Tree Concept

📖 Scenario: Imagine you want to quickly find if a small word appears inside a bigger word or sentence. A suffix tree helps by organizing all endings of a word so you can search fast.

🎯 Goal: You will build a simple representation of a suffix tree for the word banana. This will help you understand how suffix trees store all endings of a word.

📋 What You'll Learn

Create a list of all suffixes of the word 'banana'.

Create a variable to count how many suffixes there are.

Use a loop to build a dictionary where each suffix is a key and its starting position is the value.

Add a final step to show the total number of suffixes stored.

💡 Why This Matters

🌍 Real World

Suffix trees are used in text search tools, DNA sequence analysis, and data compression to quickly find patterns inside large texts.

💼 Career

Understanding suffix trees helps in software development roles involving search engines, bioinformatics, and performance optimization.

1

Create a list of suffixes

Create a list called suffixes that contains all suffixes of the word 'banana'. The suffixes should be: 'banana', 'anana', 'nana', 'ana', 'na', and 'a'.

Data Structures Theory

# Create the list of suffixes for 'banana'
suffixes = []
# Your code here

Need a hint?

Start from the full word and keep removing the first letter to get each suffix.

2

Count the number of suffixes

Create a variable called count and set it to the number of suffixes in the suffixes list.

Data Structures Theory

suffixes = ['banana', 'anana', 'nana', 'ana', 'na', 'a']
# Create a variable count for the number of suffixes
count = 0
# Your code here

Need a hint?

Use the len() function to find how many items are in the list.

3

Build a suffix tree dictionary

Create a dictionary called suffix_tree. Use a for loop with variables index and suffix to iterate over enumerate(suffixes). Inside the loop, add each suffix as a key and its index as the value in suffix_tree.

Data Structures Theory

suffixes = ['banana', 'anana', 'nana', 'ana', 'na', 'a']
count = len(suffixes)
# Create suffix_tree dictionary and fill it with suffixes and their start positions
suffix_tree = {}
# Your code here

Need a hint?

Use enumerate() to get both the position and the suffix in the loop.

4

Add total suffix count to suffix tree

Add a new key 'total_suffixes' to the suffix_tree dictionary and set its value to the count variable.

Data Structures Theory

suffixes = ['banana', 'anana', 'nana', 'ana', 'na', 'a']
count = len(suffixes)
suffix_tree = {}
for index, suffix in enumerate(suffixes):
    suffix_tree[suffix] = index
# Add total_suffixes key to suffix_tree
# Your code here

Need a hint?

Assign the count to the dictionary with the key 'total_suffixes'.