How to create a tree structure,like I want to create Bill/Payment Tree

How to create a tree structure , like I want to create a Bill/Payment Tree containing a single node for all A/R related activities for a specific bill period, in reverse chronological order. Basically the tree should look like
+ Bill - Date: 03-17-2010 Complete
+++++ CR Note - Date: 05-04-2010 Complete
++++++++++ Pay - Date: 05-04-2010 Frozen
+ Bill - Date: 03-17-2010 Complete
+++++ Pay - Date: 05-04-2010 Frozen
And finally this should be attached as tab on the control central

The FTree package provides functions to populate the tree - look for the topic "Manipulating a hierarchical tree at runtime
" in the online help this point to all the functions and triggers

Similar Messages

Can we change the Bill/Payment tree structure on Control central page?

Can we change the Bill/Payment tree structure on Control central page to Bill/Payment Tree containing a single node for all A/R related activities for a specific bill period, in reverse chronological order. Basically the tree should look like
+ Bill - Date: 03-17-2010 Complete
+++++ CR Note - Date: 05-04-2010 Complete
++++++++++ Pay - Date: 05-04-2010 Frozen
+ Bill - Date: 03-17-2010 Complete
+++++ Pay - Date: 05-04-2010 Frozen
I have tried changing controlCentralBPTree.xml but if I do that the tree is not expanding its just collapsed I m not able to expand.
So do I need to change some other file to change the tree structure and look like above?

Hello CHS.
I tested your project but to change the label and has not worked.
I tried running the Application Module and test the ViewCriteria, and show correctly the labels defined in control hint of bind variable.
Again, I think the component af:query should do the same, but does not work.
Any Oracle ACE Director some could verify this problem?
thank you very much

Creating a tree structure like Windows file explorer using Jdev

Hi All,
Is it possible to develop a tree structure like windows in JDEV and then same page I want to move to oracle apps.
This tree I am creating for Showing Employee information. Like Parents & childs under it. i.e. Managers and employee reporting to managers.
Please let me know if it is possible, if yes how , what is method of doing this.
Thanks
Ganesh Mane

Yes. This possible with ADF Faces RC, which provides an af:tree component. Have a look at the Fusion Order Demo, which uses the tree to implement a similar usecase to the one you describe.
http://www.oracle.com/technology/products/jdev/samples/fod/index.html
Regards,
RiC

I created an outline font and manipulated to create a new logotype. now i want to created a solid font from the outline as a single stroke -- how?

i created an outline font and manipulated to create a new logotype. now i want to created a solid font from the outline as a single stroke -- how?

g,
As I (mis)understand it, you may have a look at the ways suggested in these threads, increasing the Stroke Weight as desired after creating the centre path:
Re: How to make perfect thin inner outline of text?
Typography effect

F4 Help for Training Event -Tree structure like in PSV2

Hi,
There is any function module to give the F4 help in custome development for Training Event like Tree structure in PSV2.

Check AL S's response here for how to do this. CVI 6.0 does not have a native Tree control. This was introduced with CVI 7.0.
Bilal Durrani
NI

Tree structure like in win explorer?

Hello everybody,
I need in my program a structure like the tree structure in the windows explorer. Is is possible to program something like this in LabWindows/CVI 6.0 ?
The program have to simulate an equipment. The tree is for a better finding of the "events", the equipment can do.
The last "file" in the tree should I took to some buttons to simulate the event. But this I think is not the problem.
thx for solving my problem ;-)

Check AL S's response here for how to do this. CVI 6.0 does not have a native Tree control. This was introduced with CVI 7.0.
Bilal Durrani
NI

TDMS File Creates Multiple Tabs of Data. Want to create only one.

Hello NI Community,
I am currently using the DAQ Assistant with my string pots to record displacement over a long interval of time (see attached VI). I am then using the "Write To Measurement File" vi to save the data into a TDMS file (see the "Write to File Settings" picture attached for all settings chosen for file write). The file is being written, however when I open the TDMS file, the document creates a tab in Excel for every second of data recorded (please see the attached "). It looks like the TDMS file is grouping all the data from each second together and then creating a new group of data.
How do I get the file to write all the data onto a single tab instead of creating multiple? I do not want to have to concatenate hundreds of tabs into a single excel sheet.
Thanks,
Chris
Solved!
Go to Solution.
Attachments:
Write to File Settings.PNG ‏40 KB
TDMS File Multiple Tabs.PNG ‏57 KB
TDMSWrite.vi ‏108 KB

You should not be using the comment. I just removed that and it all worked for me.
There are only two ways to tell somebody thanks: Kudos and Marked Solutions
Unofficial Forum Rules and Guidelines

How to create a form on a tree structured table

Hi,
I have a table that is designed to do a tree structure like:
Table Name: test
Fields:
ID
ParentID
Description
I created a browser (IR) (page 1) that calls a form (page 2)
The form has the editing fields and at the bottom layer I have a reports region where I display the children records using a query like:
select * from test where ParentID = :P2_ID
I need at the region level to add a button to call a form to edit the child record (which is the same table) and when done, to return to the form again but to the parent record.
How can I do that successfully? Is there any example:?
Thank you

Maybe this can help:
http://apex.oracle.com/pls/otn/f?p=31517:157
using instead of trigger on a view.
Denes Kubicek
http://deneskubicek.blogspot.com/
http://www.opal-consulting.de/training
http://apex.oracle.com/pls/otn/f?p=31517:1
-------------------------------------------------------------------

How to get the folder name of selected subitem in tree structure?

Hi All,
           I created a tree structure like below.
         ->Folder1-- 1
                          2
                          3
        ->Folder2-----1
                           2
                           3
                i.e i have two folders & each folder having the values like above.Now i want to perform some action by clicking on the any of the values.Suppose if i click value 2,i want to do some action.the actions need to perform is varies from floder to to folder.
        So How can i get the folder name of clicked Value?
Regards,
Ravi

Hi Kumar ,
the below code should help you.
Register the below action for the leaf node for which u need the subfolder's name above it.
Worked fine in my system ...hope it does in ur scenario too
method ONACTIONGET_PATH .
data : lr_element TYPE REF TO if_wd_context_element,
         lr_node TYPE REF TO if_wd_context_node,
         ls_path type string,
         ls_path_node TYPE string,
         lt_string type TABLE OF string,
         l_lines type i,
         l_lines_1 TYPE i.
lr_element = wdevent->get_context_element( 'CONTEXT_ELEMENT' ).
**-> getting the path of the node/leaf
*which u had clicked and from that getting the node above it
ls_path = lr_element->get_path( ).
SPLIT ls_path at '.' into table lt_string.
-> remove the first 2 entries as they will contain the view name
DELETE lt_string FROM 1 to 2.
l_lines = LINES( lt_String ).
l_lines_1 = l_lines - 1.
-> remove the last 2 entries as they will contain the element in the path
DELETE lt_string from l_lines_1 to l_lines.
LOOP AT lt_string into ls_path.
    CONCATENATE LINES OF LT_STRING into ls_path_node SEPARATED BY '.'.
ENDLOOP.
**-> getting access to the node above the leaf element
LR_NODE = WD_CONTEXT->PATH_GET_NODE( path = ls_path_node ).
lr_element = lr_node->get_element( ).
**-> Getting the name of the folder...
*here path is the attribute in my context which stores the name of the folder
lr_element->get_attribute( EXPORTING name = 'PATH' IMPORTING value = ls_path ).
endmethod.

Tree Structure?

Hi Experts,
I need to create a screen like a Tree Structure like below. If I click on the Reporting Group values folder, it should populate data from one table and by clicking on Reporting Group Levels, it should open the subfolder and need to populate the values based on the selection of folder.
Is this Tree Structure can be done in Web Dynpro?If yes, how can I go ahead for my development.
Please clarify me experts.
BR,
RAM.

Hi RAM,
Yes, it can be done in WDA.
Your requirement can be achieved as below
you can create 2 containers side by side in your view i.e. by using PANEL or transparent containers
Tree structure
Create tree uielement
Create context node for tree with required attributes
Populate the data for tree structure with node key
Details Display
Create a table to display data based on tree structure element
if structure of table of each node/leaf element of tree is different, you can create table ui element dynamically based on your data
On click of tree element, based on KEY of the selected element, you can populate the details and fill the table in the right side container
Please refer the demo component for Tree example:
WDR_TEST_TREE
Also, check the below links
Web DynPro ABAP Application using Tree and Frame - Web Dynpro ABAP - SCN Wiki
SAP nxt: How to create a three level tree node in Webdynpro ABAP
Hope this helps you.
Regards,
Rama

Selection of elements in a recursive tree structure

Hello,
I have a recursive tree structure, and I am dynamically creating the child nodes as the parent nodes get expanded. The structure at runtime after expansion of the nodes would look something like this:
Node 1
---Node 1.1
Leaf 1.1.1
Leaf 1.1.2
Leaf 1.1.3
---Node 1.2
Leaf 1.2.1
Leaf 1.2.2
Node 2
---Node 2.1
Leaf 2.1.1
---Node 2.2
Leaf 2.2.1
Leaf 2.2.2
When I select an item, say Leaf 1.1.1, that item gets highlighted. Now, when I select another node, say Node 2.1, that item gets highlighted as well. The issue now is that both Leaf 1.1.1 and Node 2.1 are highlighted, although I want only the latest selection to be highlighted.
I have the following settings on my context node of the tree:
Initialization Lead Selection = False
Singleton = False
Selection = 0..1
How can I get only the latest selection to be highlighted on the tree?

Hi Venkatramanan,
You are right - the lead selection works perfectly, and it is just an issue with the appearance. But even so, I would like to know if there is some way to control the visual highlighting of the nodes. The main cause of concern is that for a user, if he selects leaf 1 first, and then leaf 2 (from another node) next, both are highlighted, and there is no way to know which one is really selected.
I did look at the component WDR_TEST_EVENTS. The dyn-load recursive tree does not appear to have this problem, but I could not find any special handling in the code.
One more thing: I have the ignoreAction attribute set to true for all the parent nodes. The leaves have this attribute set to false, so they can be selected. But this does not seem to help with the highlighting issue.
Thanks,
Kamal

Listing File Hierarchy in console using a Tree structure

first off i'm a college student. i'm not that good at java... we got this CA in class and try as i might i just can't get my head around it
i was wondering if someone who know a bit more about java then i do would point me in the right direction, were i'm going wrong in my code
i have to list out sub-files and sub-directorys of a folder (i.e. C:/test) to console using tree structure
like this
startingdir
dir1 //subfolder of startingdir
dir11 //subfolder of dir1
dir111 //subfolder of dir11
dir12 //subfolder of dir1
file1A // document on dir1
dir2 //subfolder of startingdir
Tree.java
import java.util.Iterator;
import java.util.LinkedList;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import java.util.Deque;
public class Tree<E> {
    // Each Tree object is an unordered tree whose
    // elements are arbitrary objects of type E.
    // This tree is represented by a reference to its root node (root), which
    // is null if the tree is empty. Each tree node contains a link to its
    // parent and a LinkedList of child nodes
    private Node root;
    //////////// Constructor ////////////
    public Tree () {
    // Construct a tree, initially empty.
        root = null;
    //////////// Accessors ////////////
    public boolean isEmpty () {
    // Return true is and only if this tree is empty.
         return (root == null);
    public Node root () {
    // Return the root node of this tree, or null if this tree is empty.
        return root;
    public Node parent (Node node) {
    // Return the parent of node in this tree, or null if node is the root node.
        return node.parent;
    public void makeRoot (E elem) {
    // Make this tree consist of just a root node containing element elem.
        root = new Node(elem);
    public Node addChild (Node node, E elem) {
    // Add a new node containing element elem as a child of node in this
    // tree. The new node has no children of its own. Return the node
    // just added.
        Node newChild = new Node(elem);
        newChild.parent = node;
        node.children.addLast(newChild);
        return newChild;
    public E element (Node node) {
         return node.getElement();
    //////////// Iterators ////////////
    public Iterator childrenIterator (Node node) {
        return node.children.iterator();
    public Iterator nodesPreOrder () {
    // Return an iterator that visits all nodes of this tree, with a pre-order
    // traversal.
        return new Tree.PreOrderIterator();
    //////////// Inner classes ////////////
    public class Node {
        // Each Tree.Node object is a node of an
        // unordered tree, and contains a single element.
        // This tree node consists of an element (element),
        // a link to its parent
        // and a LinkedList of its children
        private E element;
        private Node parent;
        private LinkedList<Node> children;
        private Node (E elem) {
            // Construct a tree node, containing element elem, that has no
            // children and no parent.
            this.element = elem;
            this.parent = null;
            children = new LinkedList<Node>();
        public E getElement () {
        // Return the element contained in this node.
            return this.element;
        public String toString () {
        // Convert this tree node and all its children to a string.
            String children = "";
            // write code here to add all children
            return element.toString() + children;
        public void setElement (E elem) {
        // Change the element contained in this node to be elem.
            this.element = elem;
    public class PreOrderIterator implements Iterator {
        private Deque<Node> track; //Java recommends using Deque rather
        // than Stack. This is used to store sequence of nomempty subtrees still
        //to be visited
        private PreOrderIterator () {
            track = new LinkedList();
            if (root != null)
                track.addFirst(root);
        public boolean hasNext () {
            return (! track.isEmpty());
        public E next () {
            Node place = track.removeFirst();
            //stack the children in reverse order
            if (!place.children.isEmpty()) {
                int size = place.children.size(); //number of children
                ListIterator<Node> lIter =
                        place.children.listIterator(size); //start iterator at last child
                while (lIter.hasPrevious()) {
                    Node element = lIter.previous();
                    track.addFirst(element);
            return place.element;
        public void remove () {
            throw new UnsupportedOperationException();
    FileHierarchy.java
import java.io.File;
import java.util.Iterator;
public class FileHierarchy {
    // Each FileHierarchy object describes a hierarchical collection of
    // documents and folders, in which a folder may contain any number of
    // documents and other folders. Within a given folder, all documents and
    // folders have different names.
    // This file hierarchy is represented by a tree, fileTree, whose elements
    // are Descriptor objects.
    private Tree fileTree;
    //////////// Constructor ////////////
    public FileHierarchy (String startingDir, int level) {
        // Construct a file hierarchy with level levels, starting at
        // startingDir
        // Can initially ignore level and construct as many levels as exist
        fileTree = new Tree();
        Descriptor descr = new Descriptor(startingDir, true);
        fileTree.makeRoot(descr);
        int currentLevel = 0;
        int maxLevel = level;
        addSubDirs(fileTree.root(), currentLevel, maxLevel);
    //////////// File hierarchy operations ////////////
    private void addSubDirs(Tree.Node currentNode, int currentLevel,
            int maxLevel) {
    // get name of directory in currentNode
    // then find its subdirectories (can add files later)
    // for each subdirectory:
    //    add it to children of currentNode - call addChild method of Tree
    //    call this method recursively on each child node representing a subdir
    // can initially ignore currentLevel and maxLevel
        Descriptor descr = (Descriptor) currentNode.getElement();
        File f = new File(descr.name);
        File[] list = f.listFiles();
        for (int i = 0; i < list.length; ++i) {
            if (list.isDirectory()) {
File[] listx = null;
fileTree.addChild(currentNode, i);
if (list[i].list().length != 0) {
listx = list[1].listFiles();
addSubDirs(currentNode,i,1);
} else if (list[i].isFile()) {
fileTree.addChild(currentNode, i);
// The following code is sample code to illustrate how File class is
// used to get a list of subdirectories from a starting directory
// list now contains subdirs and files
// contained in dir descr.name
////////// Inner class for document/folder descriptors. //////////
private static class Descriptor {
// Each Descriptor object describes a document or folder.
private String name;
private boolean isFolder;
private Descriptor (String name, boolean isFolder) {
this.name = name;
this.isFolder = isFolder;
FileHierarchyTest.javapublic class FileHierarchyTest {
private static Tree fileTree;
public static void main(String[] args) {
FileHierarchy test = new FileHierarchy ("//test", 1);
System.out.println(test.toString());

Denis,
Do you have [red hair|http://www.dennisthemenace.com/]? ;-)
My advise with the tree structure is pretty short and sweet... make each node remember
1. it's parent
2. it's children
That's how the file system (inode) actually works.
<quote>
The exact reasoning for designating these as "i" nodes is unsure. When asked, Unix pioneer Dennis Ritchie replied:[citation needed]
In truth, I don't know either. It was just a term that we started to use. "Index" is my best guess, because of the
slightly unusual file system structure that stored the access information of files as a flat array on the disk, with all
the hierarchical directory information living aside from this. Thus the i-number is an index in this array, the
i-node is the selected element of the array. (The "i-" notation was used in the 1st edition manual; its hyphen
became gradually dropped).</quote>

Complex Tree Structure Query

Hi,
I have a table which contains the hierarchial data upto 4 levels. I needed to have the information of all the four levels in a row, so I created 3 tree structured views and one another view using the tree structured views as below
--To get the great grand parent id for the children*
CREATE OR REPLACE VIEW VR_PO_TREE AS
SELECT LEVEL pathlength,
connect_by_root partner_organization_id root_po,
partner_organization_id,
partner_common_name,
partner_organization_type
FROM partner_organization po
START WITH po.org_entity_above_id IS NULL
CONNECT BY PRIOR po.partner_organization_id = po.org_entity_above_id
ORDER BY po.partner_organization_id;
-- level 2 (grant parent) id
CREATE OR REPLACE VIEW VR_PO_AREA_TR AS
SELECT LEVEL pathlength,
connect_by_root partner_organization_id root_po,
partner_organization_id,
partner_common_name,
partner_organization_type
FROM partner_organization vcpo
START WITH vco.partner_organization_type = 'AREA'
CONNECT BY PRIOR vcpo.partner_organization_id = vcpo.org_entity_above_id
ORDER BY vcpo.partner_organization_id;
--level 3 (parent) id*
CREATE OR REPLACE VIEW VR_PO_REGION_TREE AS
SELECT LEVEL pathlength,
connect_by_root partner_organization_id root_po,
vcpo.partner_organization_id,
vcpo.partner_common_name,
vcpo.partner_type
FROM partner_organization vcpo
START WITH vcpo.partner_organization_type = 'REGION'
CONNECT BY PRIOR vcpo.partner_organization_id = vcpo.org_entity_above_id
ORDER BY vcpo.partner_organization_id;
---and finally created a view to have all the levels in a single row
CREATE OR REPLACE VIEW VR_PO_ALL_TREE AS
SELECT pot.pathlength,
po.partner_organization_id,
po.partner_common_name,
pot.root_po int_partner_org_id,
pot.intl_po_name int_partner_common_name,
vpat.root_po area_partner_org_id,
vpat.area_po_name area_partner_common_name,
vprt.root_po region_partner_org_id,
vprt.region_po_name region_partner_common_name
FROM partner_organization po
JOIN vr_po_tree pot
ON pot.partner_organization_id = po.partner_organization_id
LEFT outer JOIN vr_po_area_tr vpat
ON vpat.partner_organization_id = po.partner_organization_id
LEFT OUTER JOIN vr_po_region_tree vprt
ON vprt.partner_organization_id = po.partner_organization_id;
All the views are working fine, very fast, giving the expected output.
if we make a join to the view vr_po_all_tree in a query that also works fine. However, if we make an outer join to a query that has the join to vr_po_all_tree, Oracle throws an internal error - Ora-00600 internal error codes, arguments [qrctce1], [0],[0],.....
Is the view vr_po_all_tree is cause for this problem?, in such a case can any one help me to rewrite the view with a simple query to give the same results?
Thanks in advance.
Nattu
Edited by: Nattu on Nov 26, 2009 8:25 PM
Edited by: Nattu on Nov 27, 2009 11:48 AM
Edited by: Nattu on Nov 27, 2009 11:55 AM

Hi,
if we make a join to the view vr_po_all_tree in a query that also works fine. However, if we make an outer join to a query that has the join to vr_po_all_tree, Oracle throws an internal error - Ora-00600 internal error codes, arguments [qrctce1], [0],[0],.....
Is the view vr_po_all_tree is cause for this problem?As Sven said, ORA-00600 is the sign of some low-level problem, and you should seek a solution from Oracle support. Your views are not the cause of this problem; most likely, the views trigger something that would not be a problem except for a installatin problem or maybe a bug.
We can try to find a work-around for you, but don't ignore the problem.
in such a case can any one help me to rewrite the view with a simple query to give the same results?It seems very likely that you could do something that didn't involve so many CONNECT BYs and outer joins.
Post some sample data (CREATE TABLE and INSERT statements) and the results you want from that data.
Simplify as much as possible. For example, in the first view you say:
CREATE OR REPLACE VIEW VR_PO_TREE AS
SELECT LEVEL pathlength,
connect_by_root partner_organization_id root_po,
connect_by_root partner_common_name intl_po_name,
connect_by_root is_wbti is_wbti,
connect_by_root is_sil_int is_sil_int,
connect_by_root organization_entity_code int_org_entity_code,
org_entity_above_id, partner_organization_id,
partner_organization_type,
sys_connect_by_path(partner_organization_id, '\') po_path_id,
sys_connect_by_path(partner_common_name, '\') po_path_name
FROM ...That is, you're selecting 1 pseudo-column (LEVEL), 4 CONNECT_BY_ROOTs, 3 plain columns, and 2 SYS_CONNECT_BY_PATHs.
Can you post a problem with just one of each: 1 pseudo-column, 1 CONNECT_BY_ROOT, 1 plain column, and 1 SYS_CONNECT_BY_PATH? Adding the others later should be easy.
Any information you can give about the data would be helpful.
In particular,
(a) Can org_entity_above be NULL on the same row where partner_organization_type is 'AREA' or 'REGION'?
(b) How many ancestors with partner_organization_type = 'AREA' Can a node have? 1? No more than 1? 1 or more? 0 or more?
(c) Same for 'REGION'. How many ancestors with partner_organization_type = 'REGION' Can a node have? 1? No more than 1? 1 or more? 0 or more?
(d) Can a node with partner_organization_type = 'REGION' be the ancestor of a row with partner_organization_type = 'AREA'?
(e) Other way around: can a node with partner_organization_type = 'AREA' be the ancestor of a row with partner_organization_type = 'REGION'?
Some of these questions may seem silly to you, because you know the table and the data so well. I don't, so you'll have to explain things.

Save tree structure to text file and load textfile to another tree control

I'm able to save the structure and data to a text file, thanks to the "save tree structure to textfile" info found on this msg board, but can't seem to load the complete tree structure data from the text file into another tree. I've only been able to load parent data but can't get the hierarchy of the tree with the indents and child data to work.
Thanks

Thanks Tanya,
However, I'm still stumped on how to copy (from text file) to other columns in the tree (from one tree to another). I can only get the first column to load.
I've attached my working VI and a textfile that I use to load into the "User list" tree.
Rick
Attachments:
Text File to Tree V2.2.vi ‏58 KB
test file save16.txt ‏1 KB

Tree Structure Implementation in Java.

1>
How should i implement a "Tree Structure" in Java Based application.?How would i map the entries to the database table?how many tables will i require for this implementation.?
List records<String> = new ArrayList<String>();
records.add("null");
records.add("Product");
records.add("Category");
records.add("P1");
records.add("P2");
records.add("P3");
records.add("C1");
records.add("C2");
records.add("C3");
so how should i implement a Tree Structure for the above record set.
//P1,P2,P3 belong to Parent {Product}
//C1,C2,C3 belong to Parent {Category}
Sample code provided will be helpful

How should i implement a "Tree Structure" in Java Based application.?The quotes suggest you don't know what a tree structure is, regardless of the development language. Fix that first (your understanding of what a tree structure is). [url http://en.wikipedia.org/wiki/Tree_structure]Here is probably a good start.
How would i map the entries to the database table?how many tables will i require for this implementation.?It depends on what your tree structure represents, in particular it depends on whether the leaves and intermediate nodes of the trees have are homogeneous (e.g. have a common interface). There is no general rule.
I suggest you start by looking in the Java API at all the classes whose names start with 'Tree' (TreeSet and TreeMap are probably the best ones to start with) and read the documentation carefully. Then try to write some code that uses one and come back if/when you have any problems.(sorry Winston) I think this is a very bad advice.
These classes are particular implementations, respectively of a set (in the mathematical sense) and of a map (associative table), which happen to use a "tree structure" for their internal business. Their API doesn't help building a custom "tree structure" (they may be used that way, but it's certainly not the easiest nor even a particular handy way to build tree structures).
Maybe their implementation may be a good example of how to build a Tree structure, but they use a particular type of tree (+red-black tree), not a general one. This may or may not be the OP's case, I wouldn't bet on it.
OP you're welcome to come back with more specific questions and details. Good luck with Java.
Edited by: jduprez on Oct 16, 2010 2:45 PM
Edited by: jduprez on Oct 16, 2010 2:49 PM
After checking the Javadoc: indeed TreeSet only uses a TreeMap for its implementation, so the only one out of the two which does directly uses a tree structure in its implementation is TreeMap.
Edited by: jduprez on Oct 16, 2010 2:51 PM
And, to reiterate, I stand by my claim that TreeMap is not a good example of a general Tree structure: in particular it uses a tree to map keys to values, its main business is the "mapping" part, not the tree as a storage medium. Neither the keys nor the values know anything about their "children".

How to create a tree structure,like I want to create Bill/Payment Tree

Similar Messages

Maybe you are looking for