How can i store data in term of a tree structure

Question

how can i store data in term of a tree structure

Answer 1

What a tree is the question. If you just want a fast access, ehats about Hashtable or dictionary classes ? The data there is structured in a tree. For a simple binary tree, you can use something like
class Node {
Node(Object data){
   Node left;
   Node right;
   Object data = data;
void insert(Object data, Node parent){
  int test = data.compareTo(parent.data);
  if(test < 0 ){
    if(parent.left == null){
      parent.left = new Node(data);
    else{
      insert(data, parent.left);
  else{
    if(parent.right == null){
      parent.right = new Node(data);
    else{
      insert(data,parent.right);
}And so build up a binary tree. The traversing methods can be found in almost any good book (pre-order, post-order, in-order), for search you have just to look at greater/smaller and descend in the tree.
The Object data can be changed to what you want for storage, String, or primitive Numbers, Vectors ...
Is that what you search for?