notes /*returns true if is found in the tree *bool containsconst comparable xint &comps const return containsxrootcomps)/*test if the tree is logically empty return true if emptyfalse otherwise *bool isemptyconst return root =null/*print the tree contents in sorted order *void printtreeconst ifisemptycout <"empty tree<endlelse printtreeroot )/*make the tree logically empty *void makeemptymakeemptyroot )/*insert into the treeduplicates are ignored * lovely professional university