https://github.com/junaidsalim/word_searcher_using_bst

This repository contains Word Searcher Program implemented in C++ using BST
https://github.com/junaidsalim/word_searcher_using_bst

binary-search-tree cpp dsa tree word-search

Last synced: 2 months ago
JSON representation

This repository contains Word Searcher Program implemented in C++ using BST

• Host: GitHub
• URL: https://github.com/junaidsalim/word_searcher_using_bst
• Owner: JunaidSalim
• Created: 2024-01-10T07:04:21.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-01-17T16:56:47.000Z (over 1 year ago)
• Last Synced: 2025-02-11T13:52:24.655Z (4 months ago)
• Topics: binary-search-tree, cpp, dsa, tree, word-search
• Language: C++
• Homepage:
• Size: 57.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Word_Searcher_Using_BST

**Word Search in 2D Array using Binary Search Tree**

Binary Search Tree is a special type of tree that can have atmost 2 children.

**Approach:**

This C++ program employs a tree structure to search for words in a dynamically defined 2D array. The `Tree` class is designed to organize the array into a tree, making it easier to search in various directions (horizontal, vertical, diagonal). The program reads words from a file (`words.txt`) and searches for them in the array, outputting results to `output.txt`.

**Intuition:**

1. **Tree Construction:**

   - The `read_insert` method constructs a tree from the given 2D array, where each node represents a character. Horizontal and vertical connections are established for efficient traversal.

  

2. **Word Search:**

   - Various search methods (`search_hor`, `search_ver`, etc.) navigate the tree to find words in different directions (horizontal, vertical, diagonal).

   - Diagonal searches are conducted in both forward and backward directions.

  

3. **Output:**

   - The program outputs the found words along with their coordinates in the `output.txt` file.

   - The `main` function reads the array, initializes the tree, reads words from `words.txt`, and performs the searches.

**Usage:**

1. **Input Array:**

   - Modify the `array` variable in the `main` function to use a different 2D array for searching.

2. **Word List:**

   - List the words to be searched in the `words.txt` file, with each word on a new line.

3. **Output:**

   - Run the program and check `output.txt` for the word search results.

**Note:**

   - Ensure the input array and word list are appropriately formatted for accurate results.

**Execution:**

   - Compile and run the program. On execution completion, view `output.txt` for the search results.

**Example:**

   - The provided example searches for words in a crossword-like array, demonstrating the program's flexibility for different 2D structures.