Given a binary tree design an algorithm to check if the tree is a palindrome tree or not.
Palindromic tree: String formed by characters at each level should be
palindrome. Tree need not to be a complete BT.
e.g.
a
/ \
b b
/ \ / \
c d d c
/ \ \ \ \
e f g f e
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to algogeeks+unsubscr...@googlegroups.com.
