Anaplan Interview Question
Write an algorithm to check if a tree is a mirror.
Interview Answer
Anonymous
Jan 31, 2017
Traverse the tree inorder and check if the result is palindrome.
1
Write an algorithm to check if a tree is a mirror.
Anonymous
Traverse the tree inorder and check if the result is palindrome.
Check out your Company Bowl for anonymous work chats.