Please answer as many as possible $($PYTHON$3)$

$1.$

Make A the root

Add B to the right of A

Add C to the left of A

Add D to the left of C

Add E to the right of D

Add F to the right of E

Add G to the right of B

Add H to the left of B

Add I to the right of F

Give the inorder traversal of the tree generated by the above steps

$2.$

Make A the root

Add B to the left of A

Add C to the right of B

Add D to the right of A

Add E to the right of D

Add F to the left of C

Add G to the right of C

Add H to the left of B

Add I to the left of D

Give the preorder traversal of the tree generated by the above steps

$3.$

Make A the root

Add B to the right of A

Add C to the left of A

Add D to the left of B

Add E to the right of C

Add F to the left of D

Add G to the left of F

Add H to the left of C

Add I to the right of B

Give the postorder traversal of the tree generated by the above steps

$4.$

Make A the root

Add B to the left of A

Add C to the right of A

Add D to the right of C

Add E to the left of C

Add F to the right of B

Add G to the left of E

Add H to the left of B

Add I to the right of H

Give the breadth first $($level order$)$ traversal of the tree generated by the above steps