Pseudo Code for Trie Data Structure

// Trie Data Structure

Class TrieNode:
  isEndOfWord: Boolean  // Indicates if this node marks the end of a valid word
  children: Dictionary<Character, TrieNode>  // Maps characters to child nodes

  Constructor():
    isEndOfWord = False
    children = new empty Dictionary

Class Trie:
  root: TrieNode

  Constructor():
    root = new TrieNode()

  // Insert a word into the Trie
  Function insert(word: String):
    currentNode = root
    for each character in word:
      if character is not in currentNode.children:
        currentNode.children[character] = new TrieNode()
      currentNode = currentNode.children[character]
    currentNode.isEndOfWord = True

  // Search for a word in the Trie
  Function search(word: String): Boolean
    currentNode = root
    for each character in word:
      if character is not in currentNode.children:
        return False  // Word not found

      currentNode = currentNode.children[character]

    return currentNode.isEndOfWord  // True if the path ends at a word

  // Check if there is any word in the Trie that starts with the given prefix
  Function startsWith(prefix: String): Boolean
    currentNode = root
    for each character in prefix:
      if character is not in currentNode.children:
        return False  // Prefix not found

      currentNode = currentNode.children[character]

    return True  // A path exists for the prefix

  // Delete a word from the Trie (optional, more complex)
  Function delete(word: String): Boolean
    Function deleteRecursive(node: TrieNode, word: String, index: Integer): Boolean
      if index == length(word):
        if not node.isEndOfWord:
          return False  // Word not in Trie
        node.isEndOfWord = False
        // If this node has no other children and is not the end of another word,
        // it can be deleted on the way back up.
        return isEmpty(node.children)

      character = word[index]
      if character is not in node.children:
        return False  // Word not in Trie

      shouldDeleteChild = deleteRecursive(node.children[character], word, index + 1)

      if shouldDeleteChild and isEmpty(node.children[character]) and not node.isEndOfWord:
        remove node.children[character]

      return isEmpty(node.children) and not node.isEndOfWord

    return deleteRecursive(root, word, 0)

  // Helper function to check if a node's children dictionary is empty
  Function isEmpty(dictionary: Dictionary): Boolean
    return size(dictionary) == 0

// Example Usage:
trie = new Trie()
trie.insert("apple")
trie.insert("apricot")
trie.insert("banana")

print(trie.search("apple"))      // Output: True
print(trie.search("app"))        // Output: False
print(trie.startsWith("app"))    // Output: True
print(trie.startsWith("ban"))    // Output: True
print(trie.search("banana"))     // Output: True

trie.delete("apple")
print(trie.search("apple"))      // Output: False
print(trie.startsWith("app"))    // Output: True (because "apricot" still exists)

trie.delete("apricot")
print(trie.startsWith("app"))    // Output: False

print(trie.search("banana"))     // Output: True
trie.delete("banana")
print(trie.search("banana"))     // Output: False
print(trie.startsWith("ban"))    // Output: False