Because with c++ compiler I'm not able to plot the function. Because maybe, I don't have the library

I tried but it don't work 😂 can i post the code?

How can i ckeck if house in on the line/column?

#include <iostream> #include <cstdio> using namespace std; int main() { int max_of_four(int a, int b, int c, int d) { if(a < b) { a = b; } if(a < c) { a = c; } if(a < d) { a = d; } return a; } return 0; }

i can not execute this code, where is the errors coming from?

You are making a function inside the main function

i have to use the max_of_four so how can i fix it?

Place the function outside the main and call it in main()

i don't quite understand

i don't quite understand

Get it?

yes, thank you! that's clearly new for me.

Welcome! You seem new to programming.

#include <iostream> #include <cstdio> using namespace std; int max_of_four(int a, int b, int c, int d) { if (a < b) { a = b; } if (a < c) { a = c; } if (a < d) { a = d; } return a; } int main() { cout << max_of_four(5, 4, 6, 3); return 0; } Like this...

also, how do i make 5, 4, 6, 3 changeable? i mean without literally putting 5, 4, 6, 3 there

also, how do i make 5, 4, 6, 3 changeable? i mean without literally putting 5, 4, 6, 3 there

Or take it from the user, store in a variable and pass it as arguments there...

i don't understand this either😢

Go read K&R C programming language book

If you do int a= -9; Char b=a; cout<<b; You will get output as ≈

If you do int a= -9; Char b=a; cout<<b; You will get output as ≈

Hello , why do negative int values example -1 print char values as '≈' even though ASCII values are only positive .

char is just byte. You can assign any 8bit value there. I will be interpreted some how. By default char is unsigned so this is undefined behavior.

Compiler doesn't recognise this symbol 😑 IDK

char can be either signed or unsigned — it depends on a compiler

So it's just a random output ?

14 46 C:\Users\swapnil\Desktop\PCC\assignment\ds exp 7 code 1.cpp [Error] invalid conversion from 'void*' to 'node*' [-fpermissive]

#include<stdio.h> #include<math.h> #include<stdlib.h> struct node { int data; struct node *left; struct node *right; }; struct node* newnode(int d) { struct node *temp=malloc(sizeof(struct node)); temp->data=d; temp->left=NULL; temp->right=NULL; return temp; } struct node* insert(struct node *r,int d) { if(r==NULL) { return newnode(d); } else if(d>r->data) { r->right=insert(r->right,d); } else { r->left=insert(r->left,d); } } struct node* min(struct node *r) { if(r->left==NULL) return r; else return min(r->left); } struct node* deletion(struct node *r,int d) { if(r==NULL) { return NULL; } else if(d>r->data) { r->right=deletion(r->right,d); } else if(d<r->data) { r->left=deletion(r->left,d); } else { if(r->left==NULL && r->right==NULL) { free(r); return NULL; } else if(r->left==NULL || r->right==NULL) { struct node *t; if(r->right==NULL) t=r->left; else t=r->right; free(r); return t; } else { struct node *t=min(r->right); r->data=t->data; r->right=deletion(r->right,t->data); } } } void inorder(struct node *r) { if(r!=NULL) { inorder(r->left); printf("%d\t",r->data); inorder(r->right); } } void preorder(struct node *r) { if(r!=NULL) { printf("%d\t",r->data); preorder(r->left); preorder(r->right); } } void postorder(struct node *r) { if(r!=NULL) { postorder(r->left); postorder(r->right); printf("%d\t",r->data); } } void search(struct node *r,int d) { if(r==NULL) { printf("%d not found.\n",d); } else if(d>r->data) { search(r->right,d); } else if(d<r->data) { search(r->left,d); } else { printf("%d found.\n",d); } } int height(struct node *r) { if(r==NULL) return 0; else { int ld=height(r->left); int rd=height(r->right); if(ld>rd) return(ld+1); else return(rd+1); } } int main() { int n,i,d,c; struct node *root=NULL; printf("Enter root node.\n"); scanf("%d",&d); root=newnode(d); do { printf("Enter 1 to insert element.\nEnter 2 to delete element.\nEnter 3 to display traversals.\nEnter 4 to search an element.\nEnter 5 to find height of tree.\nEnter 6 to exit.\n"); scanf("%d",&c); switch(c) { case 1: printf("\nEnter the no of nodes\n"); scanf("%d",&n); printf("Enter binary tree in order level.\n"); for(i=0;i<n;i++) { scanf("%d",&d); insert(root,d); } break; case 2: printf("\nEnter the data to be deleted.\n"); scanf("%d",&d); deletion(root,d); break; case 3: printf("\n\nInorder:-\n"); inorder(root); printf("\n\nPreorder:-\n"); preorder(root); printf("\n\nPostorder:-\n"); postorder(root); printf("\n"); break; case 4: printf("\nEnter the data to be searched.\n"); scanf("%d",&d); search(root,d); break; case 5: printf("\nThe height of tree is %d\n",height(root)); break; case 6: printf("\nThank you.\n"); break; default:printf("\nInvalid input!\n"); break; } printf("\n\n"); }while(c!=6); }

struct node *temp=malloc(sizeof(struct node))

I have one question about arrays .Can anyone who knows the arrays write to me ?