binary tree questions

[jamesfarrow]

now public part of class, not ideal :(

public:
    void printHelper(node<T>* root)
    {
        if(root==NULL)
        {
            return;
        }
        std::cout << root->m_val <<" ";
        printHelper(root->m_left);
        printHelper(root->m_right);
    }
    
    tree(T v)
    {
        std::cout << "tree cons" << std::endl;
        insert(v);
    }
    tree()
    {
        std::cout << "tree cons" << std::endl;
    }
    
    ~tree()
    {
        std::cout << "tree destructor" << std::endl;
        delete root;
    }
    
    void insert(T v)
    {
        if(!root)
        {
            root = new node(v);
        }
        else
        {
            PrivateInsert(v, root);
        }
    }
    
    void remove(T v)
    {
        RemoveNodePrivate(v, root);
    }
   
    bool contains(T v)
    {
        return PrivateContains(v, root);
    }
    
    void print()
    {
        printHelper(root);
    }
    
    int FindSmallest()
    {
       return FindSmallestPrivate(root);
    }
    
    int getNodeKey()
    {
        return nodeToRemoveKey;
    }
    
    void setNodeKey(T value)
    {
        nodeToRemoveKey = value;
    }
};

#endif /* tree_hpp */

[zapshe]

What's wrong with that? Too long?

[jamesfarrow]

Yeah it’s too long to post all in one ☹️