The trees tag has no wiki summary.
1
vote
2answers
76 views
Count function on tree structure (non-binary)
I am implementing a tree Data structure in c# based (largely on Dan Vanderboom's Generic implementation). I am now considering approach on handling a Count property which Dan does not implement.
The ...
4
votes
2answers
126 views
Web Crawler for Learning Topics on Wikipedia
When I want to learn a vast topic on wikipedia, I don't know where to start. For instance say I want to learn about Binary Stars, I then have to know other things linked on that pages and linked pages ...
-1
votes
2answers
58 views
Figuring a max repetitive sub-tree in an object tree
I am trying to solve a problem of finding a max repetitive sub-tree in an object tree.
By the object tree I mean a tree where each leaf and node has a name.
Each leaf has a type and a value of that ...
12
votes
5answers
402 views
How should I create a mutable, varied jtree with arbitrary/generic category nodes?
Please note: I don't want coding help here, I'm on Programmers for a reason. I want to improve my program planning/writing skills not (just) my understanding of Java.
I'm trying to figure out how to ...
2
votes
2answers
289 views
Design pattern for access to tree-like database in Java?
I'm developing a Roleplaying character viewer/manager programme for a locap LARP system. The Characters have access to skills that are layed out in a tree-like structure. There are a lot of skills, ...
1
vote
2answers
143 views
Efficient way to compare scene-graph trees
I'm designing a scene graph system, where it is required to compare two trees. The trees are populated with individual objects, each with varied number of children; and they have a root.
Eg: Parent: ...
4
votes
1answer
162 views
Inexpensive generation of hierarchical unique IDs
My application is building a hierarchical structure like this:
root = {
'id': 'root',
'children': [ {
'name': 'root_foo',
'children': []
}, {
'id': 'root_foo2',
'children': [ {
...
2
votes
3answers
276 views
What is the name of this tree?
It has a single root and each node has 0..N ordered sub-nodes . The keys represent a distinct set of paths. Two trees can only be merged if they share a common root. It needs to support, at minimum: ...
1
vote
2answers
308 views
In order traversal of M way Trees
If we have a 4 way tree such as the one shown below, and we do an in order traversal, what would the output of the in-order traversal be for an M-way tree?
In which order would the nodes be visited? ...
0
votes
1answer
157 views
Why can't an AVL tree be recreated using pre-order traversal?
Given a binary search tree, I understand why I can use breadth-first and pre-order traversal to list the entries of the tree in such a way as to reconstruct the tree in the order in which its ...
6
votes
1answer
176 views
Is there a way you'd implement a fast tree traversal method that would support dated versioning?
I've got a catalog at work and I want to juke it up a bit because I'm tired of it being extremely slow. I'd like to support the modified preorder tree traversal storage method for the category tree of ...
6
votes
1answer
295 views
What's the simplest example out there to explain the difference between Parse Trees and Abstract Syntax Trees?
To my understanding, a parser creates a parse tree, and then discards it thereafter. However, it can also pop out an abstract syntax tree, which the compiler supposedly makes use of.
I'm under the ...
0
votes
2answers
126 views
Adding ordered nodes to tree in arbitrary order
I have a database of nodes. Each node can have exactly one parent, but any number of children. Some nodes may be stored with no parent, but at run time, I can create a default "root" node to be the ...
4
votes
1answer
352 views
How to find Sub-trees in non-binary tree
I have a non-binary tree.
I want to find all "sub-trees" that are connected to root.
Sub-tree is a a link group of tree nodes.
every group is colored in it's own color.
What would be be the ...
3
votes
3answers
185 views
Are tree structures inherently bad for mark-and-sweep garbage collector performance?
I'm implementing a bounding volume hierarchy in F#. Since it would be for a game, I want the garbage collector to be as quick and infrequent as possible.
It seems though that I may have to pull some ...
