I'm interested in understanding how a C++ sorting numbers driver program have can have three class member functions [void insert(double x)]; [bool

I'm interested in understanding how a C++ sorting numbers driver program have can have three class member functions

[void insert(double x)];

[bool search(double x)];

[void inorder(vector <double> & v)].

The search function will call a private recursive member function [bool search(double x, BtreeNode *t)].

The inorder function is empty vector v: then fills v with inorder list of numbers stored in binary search tree