Tree Problems

tree1
Ordering property:
 __Binary Search Tree____

 Inorder Tranversal:
10,20,25,30,35,40,70,80,85,90,95

 Post Order Tranversal:
10,25,35,30,20,70,85,95,90,80,40


root= 1    avail=11


LC RC
0
80
2
3
1
40
8
0
2
70
-1
-1
3
90
4
10
4
85
-1
-1
5
25
-1
-1
6
35
-1
-1
7
30
5
6
8
20
9
7
9
10
-1
-1
10
95
-1
-1
11

-1



tree 2
Ordering property:
__None________

 Inorder Tranversal:
65,50,75,20,80,60,95,85,90

 Post Order Tranversal:
65,75,50,80,95,90,85,60,20
root=3   avail=9


LC RC
0
65
-1
-1
1
75
-1
-1
2
50
0
1
3
20
2
4
4
60
5
6
5
80
-1
-1
6
85
7
8
7
95
-1
-1
8
90
-1
-1
9

10

10

11

11

-1



tree1
Ordering property:
____None______

 Inorder Tranversal:
45,65,10,75,25,20,80,60,90,85

 Post Order Tranversal:
45,65,25,75,10,80,90,85,60,20


root=  7 avail= 10


LC RC
0
80
-1
-1
1
45
-1
-1
2
75
-1
5
3
90
-1
-1
4
85
3
-1
5
25
-1
-1
6
65
1
-1
7
20
9
8
8
60
0
4
9
10
6
2
10

11

11

-1



tree 2
Ordering property:
_Binary Search Tree___

 Inorder Tranversal:
10,20,35,45,60,70,75,80,85

 Post Order Tranversal:
20,45,35,10,75,70,85,80,60
root= 0  avail= 9


LC RC
0
60
6
8
1
75
-1
-1
2
35
3
4
3
20
-1
-1
4
45
-1
-1
5
85
-1
-1
6
10
-1
2
7
70
-1
1
8
80
7
5
9

10

10

11

11

-1