In this video, we are writing a function to determine whether a binary tree is symmetric. A #binary #tree is considered #symmetric if it mirrors itself from the center. Happy coding!
TIMESTAMPS
--------------------------------------------------------------------------------------------------------
Illustration: 00:43
Complexity analysis: 04:35
Code: 05:10
QUESTION LINKS
---------------------------------------------------------------------------------------------------------
Difficulty: Easy
Source Code: [ Ссылка ]
Problem Link: [ Ссылка ]
FIND ME HERE
--------------------------------------------------------------------------------------------------------
Website: [ Ссылка ]
Instagram: [ Ссылка ]
Twitter: [ Ссылка ]
Github: [ Ссылка ]
Evalu8 (Side project): [ Ссылка ]
Symmetric Tree - LeetCode 101
Теги
leetcodecoding interview questionsfacebook interviewfacebook interview questionamazon interview questiondata structuresdata structures and algorithmstech interviewtech interview questionprogrammingcoding interviewcoding interview preptime complexityspace complexitybig o notationbig ogoogle interviewpramp interviewalgorithmsfang interviewcomputer scienceGoogle InternshipFacebook Internshipleetcode solutionssymmetric treemlv
