Pergunta de entrevista da empresa Anaplan
Write an algorithm to check if a tree is a mirror.
Resposta da entrevista
Sigiloso
31 de jan. de 2017
Traverse the tree inorder and check if the result is palindrome.
1
Write an algorithm to check if a tree is a mirror.
Sigiloso
Traverse the tree inorder and check if the result is palindrome.