COS2611 Assignment 2 2023 Complete code for both questions, Code + comments. Create a C++ program that will display a binary search tree: inorder traversal, preorder traversal, postorder traversal, and height of the tree. The nodes of the binary search tree will be read into the code using a text ...
//Add your student name and student number
//
//
//
using namespace std;
class TreeNode
{
//keep this class as is
public:
int value; //key or data
TreeNode* left;
TreeNode* right;
//constructors
TreeNode() {
value = 0;
left = NULL;
right = NULL;
} //default constructor
TreeNode(int v) {
value = v;
left = NULL;
right = NULL;
} //parametrized constructor
}; //TreeNode
class BST
{
public:
TreeNode* root;
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller MyAssignments. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $2.81. You're not tied to anything after your purchase.