Binary search tree Write a function

bool comp( const Search_tree x, const Search_tree y)

to compare two binary search trees x, y, that store integer data. If the two trees contain the same set of integers, the function should return true, and false otherwise. Note that two binary search trees could have different topological structure but still contain the same data. You have to write all the methods and functions you need (e.g., if you use a traversal method, you have to write it here). Your function should be computationally efficient.

template

class Search_tree: public Binary_tree {

public:

private: // Add auxiliary function prototypes here.

}

bool comp(const Search_tree x, const Search_tree y) // WRITE THIS FUNCTION