Thnx Greg, did the corrections. One more thing though,
My code :
import java.util.ArrayList;
import java.util.List;
import java.util.*;
/**
*
Type: Posts; User: alex_bin
Thnx Greg, did the corrections. One more thing though,
My code :
import java.util.ArrayList;
import java.util.List;
import java.util.*;
/**
*
Why I am getting ArrayIndexOutOfBoundsException:37 at Line 23 ?
import java.util.ArrayList;
import java.util.List;
import java.util.*;
/**
*
* @author User1
Thanks for correcting, Now I am getting the correct root but the children of the tree are all the characters.
Considering the character array
char...
oops.. it should have been k instead of i.. (thanks)
import java.util.ArrayList;
import java.util.List;
import java.util.*;
/**
*
Line 51 is showing the error... It was accessing index -1
fixing that with while (p>0) gives me new error java.lang.OutOfMemoryError: Java heap space at line 54
I humbly ask you to check if I am...
I have tried implementing the algo... but i m sure somewhere something is seriously wrong..
It is giving me ArrayIndexOutOfBoundsException
Please check if I have implemented the algo properly or...
nary tree is the tree having upto n number of children
In a nutshell,
I am trying to create a nary tree from strings like :
(ROOT(S(VP(VB LT)(ADVP LT))(VP(PP(NP X)))))
The complete tree...
hey all,
I am trying to create a nary tree from string following some rules.
It takes the stored character string as input and generates an output tree. We keep on pushing alphabets onto...