Question
bool comp( const Write a function bool comp( const Search_tree x, const Search_tree y) to compare two binary search trees x, y, that store integer
bool comp(const Write a function
bool comp( const Search_tree
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 Record>
class Search_tree: public Binary_tree
public:
private: // Add auxiliary function prototypes here.
Search_tree
A binary search tree is implemented using the following node and class structure. Write a method void rank(int k, Entry &x) that returns the k-th ranked entry in x (assume 1<=k<=n where n is the number of items in the binary search tree.) Your method should stop the search as soon as the k-th item is found.
template <class Entry>
struct Binary_node {
// data members:
Entry data;
Binary_node
Binary_node
// constructors:
Binary_node( );
Binary_node(const Entry &x);
};
template <class Entry>
class Binary_tree {
public:
Binary_tree( );
bool rank(int k, Entry &x); // returns the k-th ranked entry in x
protected:
// Add auxiliary function prototypes here.
Binary_node
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started