Leetcode - Symmetric Tree (Kotlin)
This is an easy tagged leetcode question that states: Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Join the Coffee Bytez Patreon for exclusive content:
/ coffeebytez
Substack:
https://coffeebytez.substack.com/
Medium:
/ coffeebytez
Discord:
/ discord
![[Non English] 1.7 Khmer Language](https://images.videosashka.com/watch/1IHVRDyjUKs)
