PROGRAMMING WORLD

Monday, September 14, 2020

C++ Program for Preorder, Inorder, PostOrder traversal in Binary Tree

Sahil Verma Binary , Binary Tree

#include <iostream>

using namespace std;

struct Node

{

int data;

Node *left;

Node *right;

};

Node *root=NULL;

Node* createNode(int value)

{

Node *newnode = new Node;

newnode->data = value;

newnode->left = NULL;

newnode->right = NULL;

return newnode;

}

void inOrder(Node *node)

{

if (node == NULL)

return;

else

{

inOrder(node->left);

cout<<node->data<<" ";

inOrder(node->right);

}

void preOrder(Node *node)

{

if (node == NULL)

return;

else

{

cout<<node->data<<" ";

preOrder(node->left);

preOrder(node->right);

}

void postOrder(Node *node)

{

if (node == NULL)

return;

else

{

postOrder(node->left);

postOrder(node->right);

cout<<node->data<<" ";

}

int main()

{

root = createNode(20);

root->left = createNode(100);

root->right = createNode(3);

root->left->left = createNode(50);

root->left->right = createNode(15);

root->left->left->left = createNode(222);

root->right->left = createNode(250);

root->right->right = createNode(35);

cout<<"\n Inorder : \n";

inOrder(root);

cout<<"\n Preorder: \n";

preOrder(root);

cout<<"\n Postorder: \n";

postOrder(root);

return 0;

}

Output:

Arrays and basic functions associated with Array in JavaScript

Sahil Verma Array , functions

About Arrays in JavaScript:

An array is a list of elements which is to store a large amount of element under a single name. The length of the array in JavaScript is not fixed.

=> Let's define an array with numbers stored form 1 to 5.


let number = [1, 2, 3, 4, 5];

=> You can define an array with string elements.


let animal = ["dog", "Cat", "monkey", "tiger"];

=> We can also define an array with mixed elements.


let data  = [1, 2, "hello", 4];

How to access any index element in JavaScript:

For example, we want to access the second element of the data array;

we will use


data[1];

because of indexing in javascript array start from 0.

Now let's perform some operation on arrays by using build-in methods;

1. Length of the array:


let numbers = [1, 2, 3, 4];



numbers.length;

// 4

2. Map function to loop over the array and perform an action on each element in this case double all element and store it in the new array:

let numbers = [1, 2, 3, 4];

let doubleNumbers =  numbers.map(function(num) {

return 2 * num;

});

console.log(doubleNumbers);

// [2. 4. 6. 8]

So, in the above map function, we are performing the anonymous function which is doubling all the element and returning it to doubleNumbers.

3. Adding a new element at the end of the array (push function):


let numbers = [1, 2. 3. 4];/div>

numbers.push(5);



console.log(numbers);

// [1, 2, 3, 4, 5];

4. Remove element from the end of Array (pop function):


let numbers = [1, 2, 3, 4];

numbers.pop();

console.log(numbers);

// [1, 2, 3]

How to create Function in JavaScript

Sahil Verma anonymous function , functions

What are the Functions?
The function is a set of statement that perform some particular task.

How to use Functions in JavaScript?
For that first, you have defined a function and then call it to use it.

Function definition:
The function definition is done by using the function keyword that the name of the function and then with parenthesis with the number of parameters separated by commas, then curly braces including the code to be executed.

For Example: Let's define a function which return the sum of two numbers passed to it.



function add(a, b)

{
return a + b;
}

So, above is the function which on call will return the sum of a and b.
Let's break down each line of the function.

So the first line is funciton add(a, b)

The a and b are not compulsory so they are optional.
then there are set of parenthesis in which the code is written here it says

return a + b;

which mean add a and b and return it to the line which called the function.

Calling a Function:

The function is called by using the name of the function with parenthesis including parameters in between the parenthesis.

This is how you call a function;

add(10, 29);

You can also define a function without a name and that function is known as an anonymous function.

The syntax is almost the same.

const add = function(a, b)
{
return a + b;
}

So here the above function is doing the same work and it doesn't have any name and we are assigning it to add.

Anonymous functions will be used a lot when you do JavaScript programming.

Here the below is the screenshot from chrome javascript console which you can open by pressing F12 when you are in chrome.

Program of Stack using Array in C++

Sahil Verma

// Stack With array

#include <iostream>
using namespace std;

int stack[100];

int top = -1;

void push(int x)
{
if (top == 99)
{
cout<<"\nOverflow";
}
else
{
stack[++top] = x;
}
}

void pop()
{
if (top == -1)
{
cout<<"\nUnderflow";
}
else
{
cout<<"\n"<<stack[top]<<" deleted";
top--;
}
}

void show()
{
if (top == -1)
{
cout<<"\n Stack is empty";
}
else
{
cout<<"\nTopmost element: " <<stack[top];
}
}

int main()
{
int ch, x;
do
{
cout<<"\n1. Push";
cout<<"\n2. Pop";
cout<<"\n3. Print top";
cout<<"\n4. Exit";
cout<<"\nEnter Your Choice : ";
cin>> ch;
if (ch == 1)
{
cout<<"\nEnter element : ";
cin>>x;
push(x);
}
else if (ch == 2)
{
pop();
}
else if (ch == 3)
{
show();
}

} while (ch != 4);

return 0;
}

Program of Binary Search in C++

Sahil Verma Data Structure , Searching

// Binary Search

#include<iostream>
using namespace std;

int binary(int arr[], int size, int item){

int beg = 0, last = size - 1, mid;

while (beg <= last){

mid = (beg + last) / 2;

if (arr[mid] == item)
return mid;
else if (item > arr[mid])
beg = mid + 1;
else
last = mid - 1;
}
return -1;
}

int main(){

int size, item, output;

cout<<"\nEnter Size of Array : ";
cin>>size;
int arr[size];

cout<<"\nEnter "<<size<<" Elements : ";
for(int i=0;i<size;i++){
cin>>arr[i];
}

cout<<"\nEnter Element to Search : ";
cin>>item;
output = binary(arr,size,item);

if(output != -1)
cout<<"\nElement "<<item<<" Found at index "<<output;
else
cout<<"\nElement Not Found !";

return 0;
}

Program of Linear Search in C++

Sahil Verma Data Structure , Searching

// Linear Search

#include<iostream>
using namespace std;

void linear(int arr[], int size, int item){

for(int i = 0; i < size; i++)
{
if(arr[i] == item)
{
cout<<"\nElement "<<item<<" Found at index "<<i;
return;
}
}
cout<<"\n\lement Not Found !";
}

int main(){

int size, item;

cout<<"\nEnter Size of Array : ";
cin>>size;
int arr[size];

cout<<"\nEnter "<<size<<" Elements : ";
for(int i = 0; i < size; i++){
cin>>arr[i];
}
cout<<"\nEnter Element to Search : ";
cin>>item;
linear(arr,size,item);

return 0;
}

Program of Insertion Sort in C++

Sahil Verma Data Structure , Sorting

// Insertion Sort
#include<iostream>
using namespace std;

void insertion(int arr[], int size)
{
int temp, j;

for(int i = 1; i <= size - 1; i++)
{
temp=arr[i];
j=i-1;

while((temp < arr[j]) && (j >= 0))
{
arr[j+1] = arr[j];
j = j - 1;
}
arr[j+1] = temp;
}
}
int main(){

int size;

cout<<"\nEnter Size of Array : ";
cin>>size;
int arr[size];

cout<<"\nEnter "<<size<<" Elements : ";
for(int i = 0; i < size; i++){
cin>>arr[i];
}
insertion(arr,size);
cout<<"\nArray After Insertion() : ";
for(int i=0;i<size;i++){
cout<<arr[i]<<" ";
}

return 0;
}

Books Review Website

Sahil Verma Mini Project Idea , Student Record mangement

Collatz Conjecture Program in C++

Sahil Verma collatz conjection , Divide and Conquer

#include<iostream>
using namespace std;

int collatz(int n)
{
if (n == 1)
{
return 0;
}
else if(n % 2 == 0)
{

return 1 + collatz(n / 2);
}
else
{
return 1 + collatz(3 * n + 1);
}
}

int main(void)
{
int num;
cout<<"\n Enter any Number : ";
cin>>num;
cout<<"\n Answer : "<<collatz(num)<<"\n";
}

Monday, September 14, 2020

C++ Program for Preorder, Inorder, PostOrder traversal in Binary Tree

Thursday, April 23, 2020

Arrays and basic functions associated with Array in JavaScript

Wednesday, April 22, 2020

How to create Function in JavaScript

Friday, March 13, 2020

Program of Stack using Array in C++

Wednesday, March 11, 2020

Program of Binary Search in C++

Program of Linear Search in C++

Program of Insertion Sort in C++

Saturday, January 12, 2019

Books Review Website

Wednesday, September 26, 2018

Collatz Conjecture Program in C++

Labels

Popular Posts