In: Computer Science

C++

- Write a C++ program that implements a tree using a linked representation
- Each node will contain a single integer data element. Initialize the tree to contain 10 nodes.
- The program should allow for the insertion and deletion of data.
- The program should allow the user to output data in Preorder, Inorder and Postorder.

**C++ program
that implements a tree using linked
representation:**

**Source code in C++**

```
#include <iostream>
using namespace std;
struct nod {
nod *l, *r;
int d;
}*r = NULL, *p = NULL, *np = NULL, *q;
void create() {
int v,c = 0;
while (c < 6) {
if (r == NULL) {
r = new nod;
cout<<"enter value of root node\n";
cin>>r->d;
r->r = NULL;
r->l = NULL;
} else {
p = r;
cout<<"enter value of node\n";
cin>>v;
while(true) {
if (v< p->d) {
if (p->l == NULL) {
p->l = new nod;
p = p->l;
p->d = v;
p->l = NULL;
p->r = NULL;
cout<<"value entered in left\n";
break;
} else if (p->l != NULL) {
p = p->l;
}
} else if (v >p->d) {
if (p->r == NULL) {
p->r = new nod;
p = p->r;
p->d = v;
p->l = NULL;
p->r = NULL;
cout<<"value entered in right\n";
break;
} else if (p->r != NULL) {
p = p->r;
}
}
}
}
c++;
}
}
void inorder(nod *p) {
if (p != NULL) {
inorder(p->l);
cout<<p->d<<endl;
inorder(p->r);
}
}
void preorder(nod *p) {
if (p != NULL) {
cout<<p->d<<endl;
preorder(p->l);
preorder(p->r);
}
}
void postorder(nod *p) {
if (p != NULL) {
postorder(p->l);
postorder(p->r);
cout<<p->d<<endl;
}
}
int main() {
create();
cout<<" traversal in inorder\n";
inorder(r);
cout<<" traversal in preorder\n";
preorder(r);
cout<<" traversal in postorder\n";
postorder(r);
}
```

**Output**

Hope you liked my solution. All the best.

Write a complete C++ program to implements a Min-heap.
Each node will contain a single integer data element. Initialize
the Min-heap to contain 5 nodes, with the values 8, 12, 24, 32,
42.
The program should allow for the insertion and deletion of nodes
while maintaining a Min-Heap.
The program should allow the user to output data in Preorder,
Inorder and Postorder.
The program should loop with menu items for each of the above
objectives and the choice to quit.

(IN C)
Write the code to manage a Binary Tree. Each node in the binary
tree includes an integer value and string. The binary tree is
sorted by the integer value. The functions include:
• Insert into the binary tree. This function will take in as
parameters: the root of the tree, the integer value, and the
string. Note that this function requires you to create the
node.
• Find a node by integer value: This function takes in two...

Solve
this Write a C++ class that implements a stack using a linked
list. The type of data contained in the stack should be double. The
maximum size of the stack is 30. Implement the following methods: .
· Constructor and destructor; // 5 pts · void push (double value);
// pushes an element with the value into the stack. 5 pts. · double
pop (); // pops an element from the stack and returns its value. 5
pts. ·...

I've provided a Node class that implements a node of a
simple singly-linked list (with .value and .next fields), and an
empty LinkedList class. Your task is to implement
LinkedList.sort(l), where given the node l as the head of a
singly-linked list, LinkedList.sort(l) sorts the nodes in the list
into ascending order according to the values in the .value field of
each node.
Your implementation should do an in-place update of
the list. It is ok to use a simple...

Using C or C++, write a program which implements the command
pipeline ”ls -la | tr [a-zA-Z0-9] a”. Use any combination of fork,
exec, wait, read, and write necessary to create this functionality.
Note: the parent process must be the one to output the data to the
console.

You are given a reference to the root node of a binary search
tree, that implements a dictionary data structure. Please print all
the elements in depths 500 through 510, all in sorted order. A node
in a binary search tree is at depth x, if it takes x hops to get
from the root. So the root is at depth 0, the children of the root
are at depth 1, and so on. The class TreeNode defines a single...

You are given a reference to the root node of a binary search
tree, that implements a dictionary data structure. Please print all
the elements in depths 500 through 510, all in sorted order. A node
in a binary search tree is at depth x, if it takes x hops to get
from the root. So the root is at depth 0, the children of the root
are at depth 1, and so on. The class TreeNode defines a single...

In C++, write a member method delete() that
deletes a node from a linked list at a random position. (It should
first randomly generate that position. and then delete that
node).

Java
Write a menu driven program that implements the following linked
list operations :
INSERT (at the beginning)
INSERT_ALPHA (in alphabetical order)
DELETE (Identify by contents, i.e. "John", not #3)
COUNT
CLEAR

write a java program that implements the splay tree data
structure for the dictionary abstract data type.
Initially the program reads data from "in.dat", and establishes
an ordinary binary search tree by inserting the data into the tree.
The data file contains integers, one per line.
in.dat file contents:
3456
5678
1234
2369
7721
3354
1321
4946
3210
8765
Then the program starts an interactive mode. The commands are as
follows.
S 1000 - splay the tree at 1000
F...

ADVERTISEMENT

ADVERTISEMENT

Latest Questions

- Consider Neutrogena Corporation’s original strategy for producing and selling “kind to the skin” residue-free soap with...
- Patricia has been renting a two bedroom house for years. She pays $1000 per month in...
- Please discuss the following case study. In doing so, explain your approach to the problem and...
- Suppose x = 0x5A and y = 0xA5. What is the output for x | y?...
- Discuss the role of the FDA in the healthcare industry?
- Discuss the importance of boilerplate contract terms and conditions as part of the contract. How do...
- Real Madrid stadium requires seats for home and away end. The seating project results in $1.2...

ADVERTISEMENT