Book Image

The C++ Workshop

By : Dale Green, Kurt Guntheroth, Shaun Ross Mitchell
Book Image

The C++ Workshop

By: Dale Green, Kurt Guntheroth, Shaun Ross Mitchell

Overview of this book

C++ is the backbone of many games, GUI-based applications, and operating systems. Learning C++ effectively is more than a matter of simply reading through theory, as the real challenge is understanding the fundamentals in depth and being able to use them in the real world. If you're looking to learn C++ programming efficiently, this Workshop is a comprehensive guide that covers all the core features of C++ and how to apply them. It will help you take the next big step toward writing efficient, reliable C++ programs. The C++ Workshop begins by explaining the basic structure of a C++ application, showing you how to write and run your first program to understand data types, operators, variables and the flow of control structures. You'll also see how to make smarter decisions when it comes to using storage space by declaring dynamic variables during program runtime. Moving ahead, you'll use object-oriented programming (OOP) techniques such as inheritance, polymorphism, and class hierarchies to make your code structure organized and efficient. Finally, you'll use the C++ standard library?s built-in functions and templates to speed up different programming tasks. By the end of this C++ book, you will have the knowledge and skills to confidently tackle your own ambitious projects and advance your career as a C++ developer.
Table of Contents (15 chapters)

6. Dynamic Variables

Activity 6: Creating Binary Search Trees of Class Instances

Solution:

  1. Start with the skeleton main() function:
    #include <iostream>
    using namespace std;
    int main()
    {
        return 0;
    }

    Add a definition for struct numeric_tree. It requires an int value_ member, and pointers to the left and right subtrees, which are themselves numeric_tree instances:

    struct numeric_tree
    {
        int value_;
        numeric_tree* left_;
        numeric_tree* right_;
    };
  2. The root of the tree is called root. It's a pointer to numeric_tree:
    numeric_tree* root = nullptr;
  3. The add() function takes as arguments an int value to be added, and a pointer to the address of a pointer to tree—that is, a pointer to pointer:
    void add(int v, numeric_tree** pp)
    {
    }
  4. For the add() function, understand that the added item will always be added to a subtree that is equal to nullptr:
        ...