forked from adee-dev/clg
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathp2o.txt
172 lines (169 loc) · 2.61 KB
/
p2o.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
[liveuser@localhost-live clg]$ ./a.out
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
1
Enter the Element to Insert:
5
Element Inserted..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
1
Enter the Element to Insert:
7
Element Inserted..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
1
Enter the Element to Insert:
1
Element Inserted..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
1
Enter the Element to Insert:
3
Element Inserted..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
1
Enter the Element to Insert:
9
Element Inserted..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
2
Enter the Element to Search:
9
Element Found..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
3
5 1 3 7 9
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
4
1 3 5 7 9
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
5
3 1 9 7 5
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
6
The Minimum Value is: 1
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
7
Mirror Created..
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
8
The number of nodes in the Longest Path are: 3
Enter your Choice:
1) Create
2) Search
3) Display PreOrder
4) Display InOrder
5) Display PostOrder
6) Find MinValue
7) Get Mirror Image
8) Get Longest Path
9) Exit
9
[liveuser@localhost-live clg]$