Question

Consider the class specifications for the Binary Tree class and Binary Search Tree class in the attached files // BinaryTree.h #include <iostream> using namespace std; //Definition of the Node template <class elemType> struct TreeNode { elemType data; TreeNode<elemType> *left; TreeNode<elemType> *right; }; //Definition of class Binary Tree template <class elemType> class BinaryTree { protected: TreeNode<elemType> *root; public: BinaryTree(); BinaryTreel const BinaryTree<elemType>& otherTree); BinaryTree(); bool is Empty() const; virtual boot search(const elemType& searchItem) const = 0; virtual void insert(const elemType& insertItem) = 0; virtual void deleteNode(const elemType& deleteItem) = 0; private int height (TreeNode<elem Type> *p) const; int nodeCount (TreeNode<elemType> *p) const; int leafCount(TreeNode<elem Type> *p) const; }; // BinarySearchTree.h #include "BinaryTree.h" using namespace std; template <class elemType> class BinarySearchTree: public BinaryTree<elemType> { public: bool search(const elemType& searchItem) const; void insert(const elemType& insertItem); void deleteNode(const elemType& deleteItem); private void displayAscending(TreeNodecelemType> *p) const; TreeNode<elem Type> * getTreeMax(TreeNode_elemType> *p) const; TreeNode.elemTypes * getTreeMin(TreeNode<elemTypes *p) const; };

Answer 1

To display the tree nodes in the subtree of a given tree node in ascending order, you need to perform an inorder traversal of the given tree node.

C++ CODE of the function:

void displayAscending(TreeNode<elemType> *p) const
{
if(p==NULL)
return;
displayAscending(p->left);
cout<<p.data<<" ";
displayAscending(p->right);
}

To run this code, you need to include this function in your existing code.