+ def delete_recursively(self, node: Dict[Any, Any], item: Sequence[Any]) -> bool:
+ """
+ Deletes an item from the trie by walking the path from root to where it
+ ends.
+
+ Args:
+ root_node: root under which to search for item
+ item: item whose node is the root of the recursive deletion operation
+
+ Returns:
+ True if the item was not the prefix of another item such that there
+ is nothing below item remaining anymore post delete and False if the
+ deleted item was a proper prefix of another item in the tree such that
+ there is still data below item remaining in the tree.
+ """