Create a program in Python that will simulate the BST Inorder Traversal using the given tree: 2 5 Then the traversal will be [2,5,7,10,15,20] To solve this, we will follow these steps- o o o 7 o while current is not null 10 • Create two array res and stack, set curr :=root • Run one infinite loop 15 (20 push curr into a stack, and set curr :- left of curr when the length of stack-0, then return res node popped element from the stack insert a value of node into res curr:right of curr

Code in C language. Follow instructions in photo. Use text provided as input.txt file. A1, A2 20294 Lorenzana Dr Woodland Hills, CA 91364 B1, B2 19831 Henshaw St Culver City, CA 94023 C1, C2 5142 Dumont Pl Azusa, CA 91112 D1, D2 20636 De Forest St Woodland Hills, CA 91364 A1, A2 20294 Lorenzana Dr Woodland Hills, CA 91364 E1, E2 4851 Poe Ave Woodland Hills, CA 91364 F1, F2 20225 Lorenzana Dr Los Angeles, CA 91111 G1, G2 20253 Lorenzana Dr Los Angeles, CA 90005 H1, H2 5241 Del Moreno Dr Los Angeles, CA 91110 I1, I2 5332 Felice Pl Stevenson Ranch, CA 94135 J1, J2 5135 Quakertown Ave Thousand Oaks, CA 91362 K1, K2 720 Eucalyptus Ave 105 Inglewood, CA 89030 L1, L2 5021 Dumont Pl Woodland Hills, CA 91364 M1, M2 4819 Quedo Pl Westlake Village, CA 91362 I1, I2 5332 Felice Pl Stevenson Ranch, CA 94135 I1, I2 5332 Felice Pl Stevenson Ranch, CA 94135 N1, N2 20044 Wells Dr Beverly Hills, CA 90210 O1, O2 7659 Mckinley Ave Los Angeles, CA 90001

Change this to python idle

this is to be done in Assembly Language    Please list the steps that you take the first part of this document is just some useful information to help understand what is to be done the highlighted part is what I actually need help with