Write a method that can reverse a binary tree (mirroring).
Anonymous
recurse over each node: switching both left and rights of a node, and calling your function again on both child nodes (checking for nulls first)
Check out your Company Bowl for anonymous work chats.