This is a pull request containing an example of how to use Discover on a problem involving balanced binary trees. It's not complicated, but contains some tips for usage and examples of how to invoke Discover both with and without conditions. I am working on another notebook that is more complicated I will share in the future.
This is a pull request containing an example of how to use Discover on a problem involving balanced binary trees. It's not complicated, but contains some tips for usage and examples of how to invoke Discover both with and without conditions. I am working on another notebook that is more complicated I will share in the future.