Web Applications Stack Exchange is a question and answer site for power users of web applications. It only takes a minute to sign up.
Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top
Title: Word Tree
Description: Parsing a file is when you read a file to collect information from the file. In this assignment, you will parse a file, and put all of the words in a BST. You will use the BST to collect data about the number of times a word was found in the file. You should make no assumptions about which letters are in the middle (like M). The first word you encounter will be the root. If the next word is greater, put it to the right. If it is less, put it to the left. It is possible that the tree you make will be very sparse (think what happens when the first word is zylberstein). Assume all words in the file are lower case (you can convert them easily anyway). I would recommend using the string library (it makes comparisons much better).
Devise appropriate functions for a) creating a BST, b) adding any word, c) deleting any word, d) modification of any word, and e) searching any word in a BST.