A non recursive solution to the symmetric tree problem in leetcode, use BFS to traverse the tree level by level and check each level's symmetricity.