Q: Do as directed (also write the Algorithm/Pseudocode, if explicitly mentioned in the question)

• Insert the following keys in Binary Search Tree: {9, 4, 15, 2, 20, 6, 1, 21, 10, 3}
• Traverse the above tree in Pre-order fashion, also write the steps (Pseudocode)  
• Traverse the above tree in In-order fashion, also write the steps (Pseudocode)
• Traverse the above tree in Post-order fashion, also write the steps (Pseudocode)