The trees tag has no wiki summary.
4
votes
1answer
134 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': [ {
...
1
vote
3answers
251 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
202 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
127 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
113 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
156 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
95 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
279 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
160 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 ...
2
votes
1answer
132 views
Idea of an algorithm to detect a website's navigation structure?
Currently I am in the process of developing an importer of any existing, arbitrary (static) HTML website into the upcoming release of our CMS.
While the downloading the files is solved successfully, ...
4
votes
5answers
323 views
Am I overusing trees as a model or are they just very common?
I'm working on a project and I've found that I've modeled the two largest components as trees.
My main uses so far are:
Generically model physical containers (and sub containers, sub sub containers ...
