Search the Community
Showing results for tags 'binary tree'.
Found 2 results
-
Hi, On page 432, Larry mentions binary trees as good containers for data in certain circumstances. Having recently created a small C program which implemented a binary tree, I am now trying to replicate that in C++. But I am having an issue that I can't find the answer to in other forums so I'm wondering if someone can guide me in this case. Here's extracts of my code: using std::string; // rather than using the whole std namespace struct TreeNode { // A structure of type TreeNode represents one node in a binary tree of words. string the_word; // The word in this no -
Hi Larry, As per your "Tips" on page 351, I found the binary tree suggestion in the 4th bullet point a really good one to get a better understanding of memory management as well as using recursion in C. Thanks for the suggestion. My little program reads in a text file with some words in it, parses out the words and then adds them to a binary tree stored in alphabetic word order. If the word is already in the tree, it adds to a counter of that word; if it is not in the tree it adds it and sets the count for that word to one. At the end of the file, the program prints out the w