Question

Please help me with these, thank you!

3. **25.3 (Implement inorder traversal without using recursion) Implement the inorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method to display the elements. 4. **25.4 (Implement preorder traversal without using recursion) Implement the preorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the preorder method to display the elements 5. *25.5 (Implement postorder traversal without using recursion) Implement the postorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the postorder method to display the elements. 6. *25.6 (Find the leaves) Add a method in the BST class to return the number of the leaves as follows: /** Return the number of leaf nodes */ public int getNumberOf Leaves() 7. **25.7 (Find the nonleaves) Add a method in the BST class to return the number of the nonleaves as follows: /** Return the number of nonleaf nodes */ public int getNumberofNonLeaves(

Answer 1

Comment down for any queries

Please give a thumb up
____________________________

Code:

#include <bits/stdc++.h>
using namespace std;

struct BSTNode {
int value;
BSTNode *left, *right;
};

void add(BSTNode* &root, int val) {
BSTNode *newNode = new BSTNode();
newNode->value = val;
newNode->left = NULL;
newNode->right = NULL;

if(root == NULL) {
root = newNode;
return;
}

BSTNode *node = root;
while(true) {
if(val < node->value) {
if(node->left == NULL) {
node->left = newNode;
return;
} else {
node = node->left;
}
} else {
if(node->right == NULL) {
node->right = newNode;
return;
} else {
node = node->right;
}
}
}

return;
}

void preOrder(BSTNode *root) {
stack<BSTNode*> st;
cout << "Preorder traversal: ";
st.push(root);
while(!st.empty()) {
BSTNode* node = st.top();
st.pop();
cout<<node->value<<" ";
if(node->right != NULL)
st.push(node->right);
if(node->left != NULL)
st.push(node->left);
}
cout << endl;
}

void inOrder(BSTNode *root) {
stack<pair<BSTNode*,bool>> st;
cout << "Inorder traversal: ";
st.push({root,false});
while(!st.empty()) {
BSTNode* node = st.top().first;
if(st.top().second == false) {
st.pop();
st.push({node,true});
if(node->left != NULL)
st.push({node->left,false});
} else {
cout << node->value << " ";
st.pop();
if(node->right != NULL)
st.push({node->right,false});
}
}
cout << endl;
}

void postOrder(BSTNode *root) {
stack<pair<BSTNode*,int>> st;
cout << "Postorder traversal: ";
st.push({root,0});
while(!st.empty()) {
BSTNode* node = st.top().first;
if(st.top().second == 0) {
st.pop();
st.push({node,1});
if(node->left != NULL)
st.push({node->left,0});
} else if(st.top().second == 1) {
st.pop();
st.push({node,2});
if(node->right != NULL)
st.push({node->right,0});
} else {
st.pop();
cout << node->value << " ";
}
}
cout << endl;
}

int countLeaves(BSTNode *root) {
stack<BSTNode*> st;
int cnt = 0;
st.push(root);
while(!st.empty()) {
BSTNode* node = st.top();
st.pop();
if(node->left == NULL && node->right == NULL)
cnt++;
else {
if(node->left != NULL)
st.push(node->left);
if(node->right != NULL)
st.push(node->right);
}
}

return cnt;
}

int countNonLeaves(BSTNode *root) {
stack<BSTNode*> st;
int cnt = 0;
st.push(root);
while(!st.empty()) {
BSTNode* node = st.top();
st.pop();
if(node->left != NULL || node->right != NULL) {
cnt++;
if(node->left != NULL)
st.push(node->left);
if(node->right != NULL)
st.push(node->right);
}
}

return cnt;
}

int main() {

BSTNode *root = NULL;
for(int i = 0; i < 10; i++) {
int x;
cin >> x;
add(root,x);
}

preOrder(root);
inOrder(root);
postOrder(root);

cout << "Number of leaves: " << countLeaves(root) << endl;
cout << "Number of non-leaves: " << countNonLeaves(root) << endl;

}

Output:

Input (stdin) 8 3 10 6 14 7 4 15 1 13 Your Output (stdout) Preorder traversal: 8 3 1 6 4 7 10 14 13 15 Inorder traversal: 1 3 4 6 7 8 10 13 14 15 Postorder traversal: 1 4 7 6 3 13 15 14 10 8 Number of leaves: 5 Number of non-leaves: 5

____________________________
Comment down for any queries

Please give a thumb up