Win a copy of Kotlin in Action this week in the Kotlin forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic

DSTree  RSS feed

 
kalai sundar
Ranch Hand
Posts: 69
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
i am using DSTree( diamondedge), for that i need a sample code for to count the number of nodes , and child that is dispalyed in the DSTree
 
Tad Dicks
Ranch Hand
Posts: 264
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
So just out of curiosity what is a "DSTree"? I recall studying b-tree's, b+ trees, braided trees, and regular binary trees but never heard of a "DSTree" let alone "diamond edge". Whats the basic structure or how is it different from your standard implementation of a tree?

-Tad
 
kalai sundar
Ranch Hand
Posts: 69
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
like JTree, DSTree also one componenet, JTree in swing. same way DSTree also one componenet of diamondedge. i need sample code to count the number of nodes and child, that are displayed in JTree
 
Tad Dicks
Ranch Hand
Posts: 264
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
I should think you would do something like:


Thats not code verbatim... just pseudo code, as I don't have the methods for treenode memorized. But that should give you a basic idea.

-Tad
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!