Answer Happy

Write a C program to read a binary tree from the user and
perform Post-order Traversal.Sample Input/Output Input Sample Input
for the binary tree given below will be(using array)
A -999
A B C -999 [Comment: A is the parent, B is the left child
and C is the right child ]
B D E -999
C NULL F -999 [Comment: NULL is entered because C does not
have a left child and F is the right child]
D G H -999
F I J -999
H NULL L -999
J K NULL -999
-999
Output
Post-order Traversal: G, L, H, D, E, B, I, K, J, F, C, A
Test Case 1:
Incorrect program output
--- Input ---
--- Expected output (text)---
Incorrect program output
Test Case 2:
--- Input ---
--- Expected output (text)---
Test 4: Test case 4
Incorrect program output
--- Input ---
--- Expected output (text)---
Test 5: Test case 5
Incorrect program output
--- Input ---
--- Expected output (text)---
Test 6: Test case 6
Incorrect program output
--- Input ---
--- Expected output (text)---
Test 8: Test case 8
Incorrect program output
--- Input ---
--- Expected output (text)---