Rightmost Nodes of a Tree

Given a binary tree, return all it's rightmost nodes at each level starting from the root node in an ArrayList.

---

Example:

Input :
      1                                  
     / \                                   
    2   3

Output : [1, 3]