Domanda di colloquio di Anaplan
Write an algorithm to check if a tree is a mirror.
Risposta di colloquio
Anonimo
31 gen 2017
Traverse the tree inorder and check if the result is palindrome.
1
Write an algorithm to check if a tree is a mirror.
Anonimo
Traverse the tree inorder and check if the result is palindrome.