Write a function called tree_intersection that takes two binary trees as parameters.
- Using your Hashmap implementation as a part of your algorithm, return a set of values found in both trees.
- Write out problem statement
- drew it out first because I didn't get it
- asked gpt for code first and worked backwards
- The Big O time is O(n) where n is number of nodes in each tree. Space: O(n) because it depends on how many common values.