[LeetCode]101 - Symmetric Tree - 判斷對稱樹(easy) - python

problem description: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: [1,2,2,4,3,3,4] But the following is not

>>阅读原文<<