Posts
 
Reputation
Joined
Last Seen
0 Reputation Points
Unknown Quality Score

No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.

0 Endorsements
Ranked #27.9K
~1K People Reached
About Me

Systems Analyst

Favorite Tags
c++ x 4

4 Posted Topics

Member Avatar for FBI
Member Avatar for tux4life
0
361
Member Avatar for ProgrammersTalk
Member Avatar for yutao

You can also try [URL="http://www.runtime.org/"]http://www.runtime.org/[/URL]. It really works.

Member Avatar for eskelsen
0
49
Member Avatar for DemonFox

[code] #include<stdio.h> #include<conio.h> #include<stdlib.h> #include<string.h> #include"tree.h" int main() { int x=0,n=0,i=0; int choise; PTR bt; bt=NULL; tree* ncAgora=new tree; while(x!=9) { ncAgora->insert_node(&bt,x); printf("Give Number"); scanf_s("%d",&x); } do{ printf("1.preorder\n"); printf("2.postorder\n"); printf("3.inorder\n"); printf("4.findnode\n"); printf("2.exit\n"); printf("choice?"); scanf_s("%d",&choise); switch (choise) { case 1: printf("preorder\n"); ncAgora->preorder_traversal(bt); break; case 2: printf("postorder\n"); ncAgora->postorder_traversal(bt); break; case 3: printf("inorder\n"); …

Member Avatar for eskelsen
0
114

The End.