- Please Just Solve Part Two 2 Please Just Solve Part Two 2 1 (12.79 KiB) Viewed 33 times
- Please Just Solve Part Two 2 Please Just Solve Part Two 2 2 (17.15 KiB) Viewed 33 times
Part 1: Using an AVL tree, insert the following elements: 8, 3, 11, 14, 19, 32, 33, 12, 1, 2. Show the tree after each insert and list the rotation(s) that is needed if one is needed ie Left-Left, Left- Right, etc.
Part 2: Draw and give the results of the pre-order, in-order, and post-order traversal on your AVL tree result from Part 1 of this section. Describe the traversal algorithms in general and what the difference is between the three traversals. Show steps for the following tree.