1. take the nodes at current level i in an array. 2. check if the current level is palindrome.
On Mon, Sep 2, 2013 at 3:25 PM, Bhawin <bhawinkumar.thu...@gmail.com> wrote: > 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. > -- 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.
