Given a binary tree, return the bottom-up level order traversal of a binary tree

Bottom-up level order traversal of a binary tree

Given a <code>binary tree</code>, return <code>levels</code> traversal in <code>descending order</code>
 
<code>Example 1</code>
<pre><code>Input: 1 
 / \ 
 5 3 

Output: [[5, 3], [1]]
</code></pre>
<code>Example 2</code>
<pre><code>Input: 1 
 \ 
 3 

Output: [[3], [1]]
</code></pre>

53: Level order traversal of a binary tree 2