TREE   Linked lists, stacks and queues are linear data structures. A tree is a nonlinear, two-dimensional data structure. Tree nodes contain two or more links.  trees whose nodes all contain two links (none, one or both of which may be null). Basic …

Code: #include<iostream> #include<bits/stdc++.h> using namespace std; main() { int arr[]={1,4,8,6,5,4,3,0}; int x=sizeof(arr)/sizeof(arr[0]); stable_sort(arr,arr+x,greater<int>()); cout<<"\nResort:"; for…

write a program to sort a array in ascending order in Assembly Language   Code:   name "Assending order array" .model small .stack 100h .data msg db 0dh,0ah,0ah,"Number List : $" msg1 db 0dh,0ah," Sort      : $" msg3 db…

mapping in C++ with template The map associative container performs fast storage and retrieval of unique keys and associated values. Duplicate keys are not allowed—a single value can be associated with each key. This is called a one-to-one mapping…

Bubble Sort Program in C++ #include<iostream> using namespace std; void swap(int arr[],int n) { int i,j; for(i=0;i<n;i++) { for(j=0;j<n-i-1;++j) { if(arr[j]>arr[j+1]) { arr[j]=arr[j]+arr[j+1]; arr[j+1]=ar…