data-structures-and-algorithms

Challenge Summary

Find common values in 2 binary trees.

Challenge Description

1. Write a function called tree_intersection that takes two binary tree parameters.

2. Without utilizing any of the built-in library methods available to your language, return a set of values found in both trees.

Approach & Efficiency

• Space: O()

• Time: O()

Author : Emad Idris ✌✌✌✌✌✌✌✌✌✌✌✌✌

Hello Teacher Mohamed I’m Emad This is Screen Shot of Test