ATL / WTL / STL

tree<int> m_tree;
m_tree.AddNode(1);
m_tree.AddNode(2);
m_tree.AddNode(3);

Not everything that can be counted counts, and not everything that counts can be counted. - Albert Einstein

template <typename T>
struct Node {
    T data;
    Node* parent; // Optional member, can make navigation easier
    std::list<Node*> children;
};
 
// Then you can write simple functions like: 
template <typename T>
Tree_AppendChild(Node<T>* node, const T& value) {
   ...
}
 
template <typename T>
Tree_InsertChild(Node<T>* node, const T& value, int pos) {
   ...
}
// etc...

int bin_search(vector<char>&A, char key)
{
	int left = 0;
	int right = A.size() - 1;
	while(left < right)
	{
		int mid = (left + right)/2;
		if(A[mid] == key) return mid;
		else if(A[mid] < key)
			left = mid + 1;
		else
			right = mid + 1;
	}
	return A.size();
}

Not everything that can be counted counts, and not everything that counts can be counted. - Albert Einstein

class scaneql
{
public:
   scaneql( int lookfor) : i(lookfor) {}
   bool operator()(const scan & a) const
   {
     return a.i == i;
   }
   private:
     int i; 
   };
...
std::vector< scan>::const_iterator curScan = std::find_if(m_rows.begin(), m_rows.end(), scaneql((int)y));