Write Android app to traverse a binary tree. Do this as a learning exercise.
https://en.wikipedia.org/wiki/Tree_traversal
Practice traversing a binary tree using recursive depth first search.
https://github.com/beepscore/tree_traverser
Write a method to check if a tree contains a node with a given value.
Values are not necessarily sorted.
Implement depth first recursive traverse.
Alternative method. Implement breadth first traverse. Use stack or queue.
See tests for implemented behavior.