i have to create a program that takes a line of text and puts it in a binary search tree.
from my understanding, a bst is balanced where the root node is an item and if the next item is less than the root, then it gets pointed to by the root's left pointer. and if it's greater than the root, then it gets pointed to by the root's right pointer. and throw in some recurssion and you have yourself a balanced bst.
my main problem is comprehending the part about the line of text and the bst. so far i've only dealt with numbers. how can i do this using words? given a line of text, i can separate it using getline and other methods to manipulate strings.