3 problems in this category
Return the maximum depth of the binary tree.
O(n)
O(h)
Check if two binary trees are the same.
Return the level order traversal of a binary tree.