[SOLVED!] Symmetric Tree - LeetCode 101 - Java

preview_player
Показать описание
[SOLVED!] Symmetric Tree - LeetCode 101 - Java

#coding #interviews #softwareengineering

The solution to LeetCode problem 101.

Description: Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Solution: I start with software engineering interview question by explaining the problem, coding the solution, running it through IntelliJ, and finally submitting it in LeetCode. Join me as I try to explain the solution and like or subscribe if you found it helpful. Thanks!

SOCIAL
----------------------------------------------------------------------------------------------------------------
Рекомендации по теме