Skip to content

Keeththi2003/Binary-Search-Tree

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Binary Search Tree

Student Information

Tested Enviroment

Tested on Linux: Yes, the code was tested and successfully ran on Pop OS.

Excution Method

How to execute the program:

  1. Run the following command to compile the code:

       make
  2. Run the program with:

       make run
  3. To remove the compiled files, run:

       make clean

Notes

  • The program reads words from the file words.txt and constructs a Binary Search Tree (BST) based on these words.
  • The program outputs the tree structure, size, height, maximum value, minimum value, and the mirror image of the tree.
  • Ensure words.txt exists in the same directory as the executable to avoid file reading issues.
  • Ensure data in 'words.txt' enters in below format
  Cat
  Dog
  Rat
  Bat
  Bag
  Nut
  Mug
  Cup
  Kid
  Dig

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published