Hey I ran this program in vscode and found that the binary tree traversals orders show wrongly the orders. What's wrong in this

Question

//Binary tree traversal: #include <stdio.h> #include <conio.h> #include <malloc.h> struct node { struct node *left; int data; struct node *right; }; void main() { void insert(struct node **,int); void inorder(struct node *); void postorder(struct node *); void preorder(struct node *); struct node *ptr; int no,i,num; ptr = NULL; ptr->data=NULL; clrscr(); printf("\nProgram for Tree Traversal\n"); printf("Enter the number of nodes to add to the tree.<BR>\n"); scanf("%d",&no); for(i=0;i<no;i++) { printf("Enter the item\n"); scanf("%d",&num); insert(&ptr,num); } //getch(); printf("\nINORDER TRAVERSAL\n"); inorder(ptr); printf("\nPREORDER TRAVERSAL\n"); preorder(ptr); printf("\nPOSTORDER TRAVERSAL\n"); postorder(ptr); getch(); } void insert(struct node **p,int num) { if((*p)==NULL) { printf("Leaf node created."); (*p)=malloc(sizeof(struct node)); (*p)->left = NULL; (*p)->right = NULL; (*p)->data = num; return; } else { if(num==(*p)->data) { printf("\nREPEATED ENTRY ERROR VALUE REJECTED\n"); return; } if(num<(*p)->d

Answer 1

Input:
9
4 7 3 6 10 1 2 5 3
...is outputting:
INORDER TRAVERSAL

Data :1
Data :2
Data :3
Data :4
Data :5
Data :6
Data :7
Data :10
PREORDER TRAVERSAL

Data :4
Data :3
Data :1
Data :2
Data :7
Data :6
Data :5
Data :10
POSTORDER TRAVERSAL

Data :2
Data :1
Data :3
Data :5
Data :6
Data :10
Data :7
Data :4

Where do you think this is wrong?

Answer 2

Wow can you even read that code?

Answer 3

Thank you

Answer 4

I copied the code and tested run in C4Droid but I'm getting segmentation fault problem. I don't know how VSCode got to run that code at all ...

Answer 5

I copied your code and made a couple of alterations (to get it running) and it appears to be showing the right orders. Can you give an example of where it goes wrong?

https://code.sololearn.com/cRDVQVWgfqXM/?ref=app

Answer 6

https://forgetcode.com/C/267-Binary-Tree-Traversal

Answer 7

Pls see the whole coding in above link

Answer 8

Sry about the mess I did above😅

Answer 9

I think the code doesn't give the inorder postorder according to the rule. It just prints in same order and reverse order which I think is incorrect?

Answer 10

What do you mean reverse order? What input are you submitting?

Answer 11

If I give input:1 2 3 4
Inorder:1 2 3 4
Postorder: 4 3 2 1

But according to rule
Inorder should be left subtree and root and right subtree

Answer 12

There are no left subtrees if the input is 1 2 3 4