yes..DFS seems a good solution..then look until u get a Z..here is a
piece of code..
static ArrayListInteger buffer;
void findSum(TreeNode head, Node nodeZ,ArrayListInteger buffer) {
if (head == null || head == nodeZ) return;
buffer.add(head.data);
ArrayListInteger c1 = (ArrayListInteger)
small correction in my post..
yes..DFS seems a good solution..then look until u get a Z..here is a
piece of code..
void findSum(TreeNode head, Node nodeZ,ArrayListInteger buffer) {
if (head == null || head == nodeZ) return;
buffer.add(head.data);
ArrayListInteger c1 = (ArrayListInteger)
and Y..sorry for multiple posts..
On Jan 8, 3:18 am, Newbie grajesh...@gmail.com wrote:
small correction in my post..
yes..DFS seems a good solution..then look until u get a Z..here is a
piece of code..
void findSum(TreeNode head, Node nodeZ,ArrayListInteger buffer) {
if (head == null
