spkdroid / Trie

Trie Data Structure in Java

A simple implementation of a Trie data structure in Java.

Table of Contents

• Introduction
• Features
• Getting Started
  • Usage
• Contributing
• License
• Acknowledgments

Introduction

This project provides a basic implementation of a Trie data structure in Java. A Trie is a tree-like data structure used for storing a dynamic set or associative array where the keys are usually strings. Tries are particularly efficient for tasks involving dynamic sets and when there is a natural hierarchy in the keys, such as with strings.

Features

• Insertion of keys into the Trie.
• Searching for keys in the Trie.

Getting Started

Usage

Clone the repository and compile the Java code:

javac Trie.java

Run the example:

java Trie

This will demonstrate basic Trie operations.

Contributing

If you'd like to contribute to this project, please follow the Contribution Guidelines.

Authors

• Ramkumar Velmurugan - Portfolio

License

Copyright 2023 Ramkumar Velmurugan

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

   http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.