# Leetcode 498 - Diagonal Traverse

Note:

• Imagine this matrix as a binary tree, then use level order traversal.

Question:

Given an m x n matrix mat, return an array of all the elements of the array in a diagonal order.

Example:

Code: