Re: [algogeeks] Palindrome tree

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 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 l

Re: [algogeeks] Palindrome tree

bool check_palin(vector v){ vector v1(v); reverse(v1.begin(),v1.end()); for(int i = 0;i q; q.push(root); q.push(NULL); vector v; while(!q.empty()){ while(q.front()){ node *l = q.front(); q.pop(); v.push_back(l->ch);

[algogeeks] Document

Hi, Did you receive the documents which I have sent earlier? If not, I have re-uploaded them on my Google drive. Click Here, I

[algogeeks] Palindrome tree

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

Re: [algogeeks] Digest for algogeeks@googlegroups.com - 1 Message in 1 Topic

http://www.geeksforgeeks.org/largest-sum-contiguous-subarray/ On Sat, Aug 31, 2013 at 4:56 PM, wrote: > Today's Topic Summary > > Group: http://groups.google.com/group/algogeeks/topics > >- find the contiguous subarray which produce largest > sum<#140d41f6fcb4d3ea_group_thread_0>[1 Updat