Search for a node in a tree

I have a standard APEX tree on a in the side bar region of a page. (using Oracle 10g APEX 3.1.0)
The tree displays and functions just fine. The initial display of the tree is the first 2 levels.
My users would like a search function of some sort that would expand the tree to only those levels that would match their search criteria.
For example if I had the following tree
Animals
|-Mammals
| |-Canines
| | |-Dogs
| | |-Wolves
| | |-Foxes
| |-Felines
| | |-Cats
| | |-Lions
| | |-Tigers
|-Birds
| |-Raptors
| |-Eagles
and so forth
and it was initially displayed
Animals
|-Mammals
|-Birds
|-Fish
and so forth
the user would like to search for Canines or Dogs or Raptors (only 1 criteria at a time) and have the tree expand to the proper branch/node.
I would provide a Search Tree button to initiate the search (refresh the page).
Anybody done this?
Bob

Hi Bob,
Here is an example were this is possible
http://www.oracle.com/technology/pub/articles/spendolini-tree.html
Kind regards,
Iloon

Similar Messages

Applescript Help: Search for text in Safari DOM tree

Im trying to make a script really similar what was asked here: Re: Find text in webpage and email notification applescript/automator Except instead of searching the "source code" of the page, I want the script to search the "DOM tree" for the page.
To summarize, I am trying to make a script that loads a safari page, searches for a particular text in the DOM Tree, and if found will send me an email.
Here is the code from the other thread I referenced:
on idle
          set pagURL to "http://page.url.com?whatever"
          if application "Safari" is not running then
                    quit
                    return
          end if
          tell application "Safari"
                    set URL of document 1 of window 1 to "http://your.web.address/"
                    delay 5
-- delay to let page load.
                    if source of document 1 of window 1 contains "search text" then
                              my sendAMail()
                    end if
                    return 900 --fifteen minutes
          end tell
end idle
on sendAMail()
          tell application "Mail"
                    set theMess to make new outgoing message at end with properties {sender:"your name", subject:"some subject line", content:"The message you want to send to yourself", visible:true}
                    tell theMess
                               make new to recipient at end of to recipients with properties {address:"[email protected]"}
                    end tell
-- send theMess
          end tell
end sendAMail
Any help would be appreciated!

For the URL you quote as an example (http://www.sislands.com/coin70/week2/NestedLoops1.htm), using text instead of source worked for me:
if text of document 1 of window 1 contains "1 2 3 4" then
another example:
if text of document 1 of window 1 contains "10 12 14 16" then
Note a double space between single digits (1 2 3 4) and a single space between double digits (10 12 14 16) is required for a match as per the table format:
Any full line:
if text of document 1 of window 1 contains "for (i = 1; i <= 10; i++) { // when i = 10" then
or partial line works:
if text of document 1 of window 1 contains "; i++) { // when i = 10" then

Xml search for specific node/attribute

Hi,
I load an xml in as3 and need to find and output (as an
XMLList) a specific node with a specific attribute (example:
<xs:element name="abcd"> ), or at least find out its path
(after, I would know what to do to get the XMLList). I looked at
the XPath classes for Actionscript but the documentation is very
poor and I did not see any method doing this. Could someone help me
please? If no method exists, how can I loop through all the xml and
test each node to see if it is the proper node I am looking for?
thanks so much in advance for your help
Pierrot

You could do it this way, using the descendant accessor:
var xml:XML =
<data xmlns:xs="
http://www.w3.org/2001/XMLSchema">
<xs:element name="abcd">
<tagA>hjfhsldf</tagA>
<tagB>dummy stuff</tagB>
</xs:element>
<xs:sequence>
<xs:element name="dd">
<tagA>words</tagA>
<tagB>dummy stuff too</tagB>
</xs:element>
</xs:sequence>
</data>;
var xs:Namespace = xml.namespaceDeclarations()[0];
var nodelist:XMLList = xml..xs::element.(@name=="dd");
trace(nodelist)
If you need generic code that accounts for no namespaces, you
can use
something like this:
var xs:Namespace = xml.namespaceDeclarations()[0];
var nodelist:XMLList =
(xs == null || xs == undefined)
? xml..element.(@name=="dd");
: xml..xs::element.(@name=="dd");
trace(nodelist)

ToolTip for each node of the Tree in JTreeTable?

Hello! I have the problem that a ToolTip i have set in the TreeCellRenderer would not been displayed! Only one ToolTip will pop up over the JTreeTable with the ToolTipText that was set in the first CellRenderer. Does everybody have an idea?

OK! Its done! The solution does not help exact, but it gives my the way! With the coordinates of the MouseEvent I can get the Value of the current table row and set the ToolTip text new. Teh ToolTipManager automatically repaints the ToolTip whit the new text and position.

ADF 11g - Search for node in a tree

I am currently working on ADF 11g. I have implemeted a hierarchical tree using a tree component. How do I implement search for a node in the tree?

You build the model yourself, so it should not be a problem to traverse the model in search for the right node.
Timo

Adding 2 icons for a single node on a tree

Hi,
I am trying to create a tree to represent objects. These objects can be of different types, and different states. I intend to use two icons for each node in the tree, one signifying the type and the other the status. I am a bit stuck though.
At present each node has a single icon, and uses a JLabel to add to the tree (with a custom renderer). Is it possible to manipulate the icons so instead of adding 2 16x16icons I can simplify it by adding a 32x16 icon?
Alternativley is it possible to customise JLabel (or something) to allow two icons to be added and alligned?
Cheers in advance
Chris

Just write your own composite Icon class:
public class CompositeIcon implements Icon
private Icon icon1;
private Icon icon2;
public CompositeIcon(Icon icon1, Icon icon2)
    this.icon1 = icon1;
    this.icon2 = icon2;
public int getIconHeight()
    return Math.max(icon1.getIconHeight(), icon2.getIconHeight());
public int getIconWidth()
    return icon1.getIconWidth() + icon2.getIconWidth();
public void paintIcon(Component c, Graphics g, int x, int y)
    icon1.paintIcon(c, g, x, y);
    icon2.paintIcon(c, g, x + icon1.getIconWidth, y);
}Hopefully a slightly more reusable solution. You could write all sorts of different layouts in this way.
Hope this helps.

How to Search for a specific element in a MultiGraph?

Hi there
Im trying to implement a Multigraph ADT in Java. Multigraph is a graph that has multible edges connecting a node. I assume you all know what a Graph ADT looks like.
So i think ive got all the basic methods functions of a normal graph/mulitgraph and now i want to search for a element in it
The question is how will i so that?
Do i use a breadth first search?
But i thought a BFS traverses all the elements in a graph? And how can i use a BFS to search for a specific element in a graph?
Thanks

Hey there
thanks for your reply but i still some query.
I thought of doing that but i want to remember the nodes i revisted to get to the target (not all - but the quickest route to that node)
My design so far is:
have 3 Interface namely Graph, Node & Edge.
Classes will inherit those interface to provide the actual implementation as i want the details/coding to be abstract meaning i can give many different way of implementations.
The graph class will add nodes & edges where when adding edges, edge will store 2 nodes in it respectively source & destination nodes.
Both Node & Edges will be stored in graph using some data structures atm (arrayList i presume)
My Design is that i want to (my aim of the task of searching) search for a node in the multigraph by inputting (maybe 2 nodes) into method - start node target node! The method should return a list of nodes to get to the target node.+
So so far i have this wee algorithm in mind:
+1. Input start + target node as parameters+
+2. Use BFS to search the graph+
+3. When reached target node - halt+
+4. return the list of nodes that visited to get there (but not all - only the precise & fastest)+
So will that work?
If so how do i go about doing implementation?
Thanks

Partial Selection in Jtree using checkbox for every node

I have a application which uses a JTree. For each node in the tree, there is a checkbox attached to the node using a customized TreeCellRenderer. When some items of a node are selected i.e not all children of a node are selected using the chechboxes, how do i indicate using the checkbox of the parent node that only a partial list of nodes is selected. For this, i need to draw a little square in the checkbox indicating that it is partially selected. Any advice on this matter would be very helpful.

It's a bit complicated. The default cell renderer doesn't actually put the tree nodes on your screen, it just paints the looks of them. That is, you see them on screen, but they are just painted, all mouse clicks etc. are sent directly to the JTree.
In order to have a button in a tree node, and have that button respond to clicks, I believe you'd have to put the button in a TreeCellEditor. This means users will have to triple click the node to get the Editor in the renderer's place (db click only expands/implodes nodes).
I have sucessfully used http://propertytree.dev.java.net/ to customize the behaviour of tree nodes, but I never have put a button in there... Have a look, you'll see what methods you need to overwrite.

How to extend breadth first Search for Binary Tree to any kind of Tree??

Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ie each node has more than 2 leaves such as 1, 2,3,4 or any,
I have following code to successfully apply for breadth first Search in Binary Tree as follows,
package a.border;
import java.util.ArrayList;
import java.util.LinkedList;
public class Tree
    int root;
    Tree left;
    Tree right;
    static ArrayList<Integer> list = new ArrayList<Integer>();
    static ArrayList<Tree> treeList = new ArrayList<Tree>();
    private static LinkedList<Tree> queue = new LinkedList<Tree>();
     * @param root root value
     * @param left left node
     * @param right right node
    public Tree(int root, Tree left, Tree right)
        this.root = root;
        this.left = left;
        this.right = right;
    /** Creates a new instance of Tree
     * You really should know what this does...
     * @param root
    public Tree(int root)
        this.root = root;
        this.left = null;
        this.right = null;
     * Simply runs a basic left then right traversal.
    public void basicTraversal()
        //Check if we can go left
        if (left != null)
            left.basicTraversal();
        //Add the root
        list.add(root);
        //Check if we can go right
        if (right != null)
            right.basicTraversal();
    public ArrayList<Integer> getBreadthTraversal(ArrayList<Integer> list)
        //Add the root to the arraylist, we know it is always the first entry.
        list.add(root);
        //Basically we add the first set of nodes into the queue for
        //traversing.
        //Query if left exists
        if (left != null)
            //Then add the node into the tree for traversing later
            queue.add(left);
        //Same for right
        if (right != null)
            queue.add(right);
        //Then we call the traverse method to do the rest of the work
        return traverse(list);
    private ArrayList<Integer> traverse(ArrayList<Integer> list)
        //Keep traversing until we run out of people
        while (!queue.isEmpty())
            Tree p = queue.remove();
            //Check if it has any subnodes
            if (p.left != null)
                //Add the subnode to the back of the queue
                queue.add(p.left);
            //Same for left
            if (p.right != null)
                //Same here, no queue jumping!
                queue.add(p.right);
            //Append to the ArrayList
            list.add(p.root);
        //And return
        return list;
     * Makes a tree and runs some operations
     * @param args
    public static void main(String[] args)
         *                             4
         *          t =           2       6
         *                      1   3    5   7
        Tree leaf6 = new Tree(1);
        Tree leaf7 = new Tree(3);
        Tree leaf8 = new Tree(5);
        Tree leaf9 = new Tree(7);
        Tree t4 = new Tree(2, leaf6, leaf7);
        Tree t5 = new Tree(6, leaf8, leaf9);
        Tree t = new Tree(4, t4, t5);
        t.basicTraversal();
        System.out.println("Here is basicTraversal ="+list.toString());
        list.clear();
        t.getBreadthTraversal(list);
        System.out.println("getBreadthTraversal= " +list.toString());
        list.clear();
    }Can Guru help how to update to any kind of tree??
here this code is for the tree like:
         *                             4
         *          t =           2       6
         *                      1   3    5   7
         */But i hope the new code can handle tree like:
         *                             4
         *                           /   | \
         *                          /     |   \
         *          t =            2     8   6
         *                        / | \    |    /| \
         *                      1 11 3 9   5 10 7
         */Thanks

sunnymanman wrote:
Dear Friends,
I am thinking a problem, How to extend breadth first Search for Binary Tree to any kind of Tree?? ...The answer is interfaces.
What do all trees have in common? And what do all nodes in trees have in common?
At least these things:
interface Tree<T> {
    Node<T> getRoot();
interface Node<T> {
    T getData();
    List<Node<T>> getChildren();
}Now write concrete classes implementing these interfaces. Let's start with a binary tree (nodes should have comparable items) and an n-tree:
class BinaryTree<T extends Comparable<T>> implements Tree<T> {
    protected BTNode<T> root;
    public Node<T> getRoot() {
        return root;
class BTNode<T> implements Node<T> {
    private T data;
    private Node<T> left, right;
    public List<Node<T>> getChildren() {
        List<Node<T>> children = new ArrayList<Node<T>>();
        children.add(left);
        children.add(right);
        return children;
    public T getData() {
        return data;
class NTree<T> implements Tree<T> {
    private NTNode<T> root;
    public Node<T> getRoot() {
        return root;
class NTNode<T> implements Node<T> {
    private T data;
    private List<Node<T>> children;
    public List<Node<T>> getChildren() {
        return children;
    public T getData() {
        return data;
}Now with these classes, you can wite a more generic traversal class. Of course, every traversal class (breath first, depth first) will also have something in common: they return a "path" of nodes (if the 'goal' node/data is found). So, you can write an interface like this:
interface Traverser<T> {
    List<Node<T>> traverse(T goal, Tree<T> tree);
}And finally write an implementation for it:
class BreathFirst<T> implements Traverser<T> {
    public List<Node<T>> traverse(T goal, Tree<T> tree) {
        Node<T> start = tree.getRoot();
        List<Node<T>> children = start.getChildren();
        // your algorithm here
        return null; // return your traversal
}... which can be used to traverse any tree! Here's a small demo of how to use it:
public class Test {
    public static void main(String[] args) {
        Tree<Integer> binTree = new BinaryTree<Integer>();
        // populate your binTree
        Tree<Integer> nTree = new NTree<Integer>();
        // populate your nTree
        Traverser<Integer> bfTraverser = new BreathFirst<Integer>();
        // Look for integer 6 in binTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, binTree));
        // Look for integer 6 in nTree
        System.out.println("bTree bfTraversal -> "+bfTraverser.traverse(6, nTree));
}Good luck!

How to search for a text node with a particular value in an xml document with labview

supposing i have the following xml document:
<head>
<book>
<bookname>zio</bookname>
<author>dan</author>
</book>
<book>
<bookname>the spear warrior</bookname>
<author>britney</author>
</book>
<book>
<bookname>the beard</bookname>
<author>derrick</author>
</book>
</head>
i want to search for the author of the book "the beard" using for example the V.I Get first match of labview to access the the node with value "the beard" and then use Get next sibling V.I and Get node text content to get get the author of this book..so my question is how do i write the xpath expression for Get first match so as to access the node with bookname "the beard" instantyly? am trying to minimise the use of loops because they increase the time duration,..thank you (NB:i dont want to use Get all Matched V.I because it obliges me to use a loop in order to access the name derrick and this increases the time duration for my v.i)
Solved!
Go to Solution.

Since it's all text, why not use a real quick Match Pattern (or Regular Expression, but you don't need that much power here), see attached.
Cameron
To err is human, but to really foul it up requires a computer.
The optimist believes we are in the best of all possible worlds - the pessimist fears this is true.
Profanity is the one language all programmers know best.
An expert is someone who has made all the possible mistakes.
To learn something about LabVIEW at no extra cost, work the online LabVIEW tutorial(s):
LabVIEW Unit 1 - Getting Started
Learn to Use LabVIEW with MyDAQ
Attachments:
Two-stage match demo.vi ‏8 KB

Unable to search for first record using the Preview tree

Post Author: TheBig1980s
CA Forum: General
Hello:
Users are unable to search for the first record in the Preview tab's tree. The reason for this is because the first record is within the first page header of the report. My guess is that, by design, Crystal takes the end user to whatever the first instance of the record iseven if that first record is in a page header. That's not "good". I want the user to be taken to the first record within the details of the reportnot within the page header.
I have suppressed the page header to not print on the first record by using OnFirstRecord. But, I still get the same issue where end users cannot select the first record in the tree without being taken to the page header. Very strange.
Can anybody think of any other ideas?
Thanks!
TheBig1980s

Thank you Dave Merchant and try67 for your responses. As per my previous post, I contacted the company re the catalogue and they have responded favourably. I'll include their response because it gives the reason for the search failure as document compression which you might find interesting. I'll await their new catalogue and see if they have fixed the problem.
Company response:
Thank you very much for your input. And yes, you are correct, the compression we used for the current catalogue's PDF format does strip out text included in the catalogue. We used the compression settings we did with the intention of minimising download time, however I take your point about including text for search purposes (which I also utilise when I'm scanning through PDFs).
We will actually be posting out our new catalogue next week and we'll release the new PDF version on the website at the same time. I've asked our graphic designer to ensure that the PDF we use for the new catalogue includes searchable text.

How to have a tree view for value node..

Hi all,
I need to display a tree view for a value node in web ui just like a model node, for a custom view in a pop up. Please guide me how to do this or let me know the process steps.
Thanks in advance.

Hi All,
while debugging I found that in class CL_BSP_WD_CONTEXT_NODE_TREE , the method GET_T_TABLE the below code is not triigerring for the child node attributes ( to trigger the get method of attribute for value node).
this call method is not triggering at all only for first coulmn its triggering ..
LV_TN ?= ME->NODE_MAPPER->GET_NODE_OBJECT( <LINE>-NODE_KEY ).
    CONCATENATE 'GET_' COMPONENT INTO LV_METHOD.
    TRY.
        CALL METHOD LV_TN->(LV_METHOD)
          EXPORTING
            ATTRIBUTE_PATH = ''
          RECEIVING
            VALUE          = VALUE.
      CATCH CX_ROOT INTO LV_ERROR.
I created the GETTER method inthe class CN01 and CN02. But those methods are not triggered in CALL METHOD LV_TN->(LV_METHOD). Even that class CN02 is having the same methods. Those methods are already Implemented. May I know what was the reason Why those methods are not triggered ( getter method ). With out that Method data will not display in the Tree view. Can anybody tell me the reason why it is not happenning?
.Please find the below .HTM code as well.
<chtmlb:configTree
                      actionsMaxInRow       = "5"
                   id             = "Table1"
                   nodeTable      = "<%= ZTREEVIEW->node_tab %>"
                   table          = "//ZTREEVIEW/Table"
                   noFrame        = "FALSE"
                   personalizable = "TRUE"
                   onCollapseNode = "NODECOLLAPSE"
                   selectionMode = "MULTILINEEDIT"
                   onExpandNode   = "NODEEXPAND"
                   onRowSelection = "select" />
Only one column was triggered another column did not get any value becasue of the above method call fail.. We are not restricted anywhere to display one column value in the output.   Even in Debugging I checked that LV_METHOD is having the method name. CN02 class is also having the same method, But it is not going into the method. It is coming out side. What could be the reason I could not able to understnad.
Please provide me some pointers on the issue....
Thanks in advance..

Tree: execute query for ech node

Hi,
I use JDeveloper 10.1.3.1.0 and ADF.
I use a af:tree object and when entire hierarchy exists of about 200 nodes, then this works fine.
Now I have a hierarchy of 2000 nodes, first level 5 nodes, second level 4 nodes per nodes, third level 10 nodes per node
and the fourth level about 10 nodes per node.
When I enter the screen, I expand only the first level, but for each node (2000) the query has been executed.
Is there a possibility to query only the first level nodes?
Regards,
LvL

Hi,
I use JDeveloper 10.1.3.1.0 and ADF.
I use a af:tree object and when entire hierarchy exists of about 200 nodes, then this works fine.
Now I have a hierarchy of 2000 nodes, first level 5 nodes, second level 4 nodes per nodes, third level 10 nodes per node
and the fourth level about 10 nodes per node.
When I enter the screen, I expand only the first level, but for each node (2000) the query has been executed.
Is there a possibility to query only the first level nodes?
Regards,
LvL

Searching for an entry in a file that contains 2 words or more...

Hey :)
I created a Binary Search Tree that would hold a list of words located in a .txt file. So, basically, the objective of the program is to search through a typed up document for the words in the search tree, and if the word is found, return it to the user to see.
I have that part working, but what I'm having trouble with is one of the entries in the file. The entry is "data structure." All the other entries are 1 word, like queue, depth-first, etc...but this one is 2 words. I'm having trouble making it so that the search will detect the 2-word entry, "data structure." How do I go about searching for entries that are 2 or more words in length?
I have been struggling with this for some time, and I don't know if it's just me, but I'd really like to get this done since this is the only thing I'm having trouble with right now. I thought I could figure this out, but I'm just putting too much time into it, and I need to submit this tomorrow.
Any help would really be appreciated! :)
Take care,
Alex

Yea, I was thinking of doing that myself. Turning the two words into one word, so it'll end up like, "datastructure," but how do I do that? Would I use the substring method? Or is there something else that I can use to get rid of whitespace. I'll look that up now on google or something, but in the meantime, if anyone can help me out with this, it would be great.
Just for a reminder, this is my problem :: I need to be able to locate an entry in my document that has 2 words in it. In this case, the entry is, "data structure." How can I go about searching for this 2 word entry? It seems to be a bit more complex than merely searching for one word. Any help you can provide me would be great! :)
Here's the code for the Binary Search Tree:
import java.io.*;
import java.util.*;
public class KeywordBinarySearchTree
     BinaryNode root;
     //static String[] docWords; // captures each of the words into an array while ignoring punctuation
     public KeywordBinarySearchTree()
          root = null;
     public void preOrderTraversal()
          preOrderTraversal(root);
     public void inOrderTraversal()
          inOrderTraversal(root);
     public Comparable findNode(Comparable node)
          return dataOfNode(findNode(node, root));
     public Comparable dataOfNode(BinaryNode node)
          if (node == null)
               return null;
          else
               return node.nodeData;
     public BinaryNode insertInOrder(Comparable iNodeData)
          BinaryNode nodeWalker;   // used to walk through each of the nodes until the appropriate spot
                                        // is found to insert the node of data
          BinaryNode parentNode = new BinaryNode(iNodeData); // represents the new root node after each pass through the tree
          if (root == null) // if it's a brand new tree with no nodes, then insert the new root of the tree
               root = new BinaryNode(iNodeData);
          else
               nodeWalker = root; // sets current root of tree to nodeWalker
               while (nodeWalker != null) // will start its first iteration of the loop at the top of the tree
                    parentNode = nodeWalker;
                    if (iNodeData.compareTo(nodeWalker.nodeData) < 0) // if the data to be inserted is less than the current
                                                                                   // node in the tree
                         nodeWalker = nodeWalker.leftChild;                  // set nodeWalker to the left child of that node
                         System.out.println("INSERT NODE: LEFT CHILD");
                    else
                         nodeWalker = nodeWalker.rightChild;                 // otherwise, set nodeWalker to the right child of that node
                         System.out.println("INSERT NODE: RIGHT CHILD");
               } // this loop will determine where the node has to travel to get to the appropriate destination. once the nodeWalker
                 // has reached its final stop, the while loop exits into the statements below to insert the new node of data
               if (iNodeData.compareTo(parentNode.nodeData) < 0)
                    parentNode.leftChild = new BinaryNode(iNodeData);
                    System.out.println("INSERT NODE: PARENT NODE LEFT CHILD");
               else
                    parentNode.rightChild = new BinaryNode(iNodeData);
                    System.out.println("INSERT NODE: PARENT NODE RIGHT CHILD");
          return parentNode;
     public BinaryNode findNode(Comparable searchNode, BinaryNode bn)
          if (bn == null)
               return null;
          else
               while (bn != null)
                    if (searchNode.compareTo(bn.nodeData) < 0)
                         bn = bn.leftChild;
                         //System.out.println("FIND NODE: LEFT CHILD DETECTED");
                    else if (searchNode.compareTo(bn.nodeData) > 0)
                         bn = bn.rightChild;
                         //System.out.println("FIND NODE: RIGHT CHILD DETECTED");
                    else // word has been spotted in the tree!
                         System.out.println(bn.nodeData);
                         return bn;
          return null;
     public void preOrderTraversal(BinaryNode bn)
          if (bn == null)
               return;
          System.out.println(bn.nodeData);
          preOrderTraversal(bn.leftChild);
          preOrderTraversal(bn.rightChild);
     public void inOrderTraversal(BinaryNode bn)
          if (bn == null)
               return;
          inOrderTraversal(bn.leftChild);
          System.out.println(bn.nodeData);
          inOrderTraversal(bn.rightChild);
// and then the code after this is the public static void main code, which I posted snippets of above.

HOW TO CREATE NODES IN A TREE DYNAMICALLY

Hi Experts,
How to create node in a tree dynamically......
my requirement is in tree there should be nodes which should contain some applications....
plz explain clearly na......
help me in this ......
waiting for u r response .....
Regars,
Shilpa

Hi shilpa,
These may help you...
Re: dynamic generation of Tree UI element
dynamic programming part in below link
http://help.sap.com/saphelp_nw2004s/helpdata/en/21/ad884118aa1709e10000000a155106/content.htm
try to search on Tree node creation in below link
http://www.sap-press.de/download/dateien/1103/sappress_maximizing_web_dynpro_for_java.pdf
regards,
Pradeep
Edited by: pradeep bondla on Jun 26, 2008 3:39 PM

Search for a node in a tree

Similar Messages

Maybe you are looking for