I was just curious what some of you more advanced programmers feel is the hardest type of tree to incorporate in data structure, have you ever had to use one professionally? Has anyone had previous experience with red-black trees, I heard they werent of much use.
Probably some "ironwood" treeOriginally Posted by camel-man
Actually, I have had pretty much no reason to implement any difficult to implement tree structures outside of an academic exercise because thus far higher level components (e.g., set and map containers) have satisfied my needs in the programming languages I use professionally.
They are useful to implement higher level components such as those that I mentioned.
Look up a C++ Reference and learn How To Ask Questions The Smart Way
Nope! a diamond-wood tree would be the hardest, in my opinion
Probably some "ironwood" tree
Red-black trees are commonly used in C programming, if you look at the source for a large C program there's often either a RB tree or a hash table implementation in them. Big libraries will implement them too, eg glib on linux has general purpose RB trees and hash table data types in it.
Generally with the dynamic structures I need, the important part is just an in-place add and delete, and the data set is not large, so I'll just use a linked list and iterate through it for look-ups (gasp!), or a hash table, depending on the nature of the task.
I have written a bayer tree (a form of RB tree) as an exercise before. It tested pretty well against C++ maps (which are RB trees) but I ended up never using the code for anything. I think if I needed a tree again I would just do a straight RB tree, the bayer is ridiculously complex. Ie, yeah I thought it was hard but like a lot of things, I'm sure it would get much easier if you worked with them often enough and became familiar with various subtleties and issues.
C programming resources:
GNU C Function and Macro Index -- glibc reference manual
The C Book -- nice online learner guide
Current ISO draft standard
CCAN -- new CPAN like open source library repository
3 (different) GNU debugger tutorials: #1 -- #2 -- #3
cpwiki -- our wiki on sourceforge
I'd say red-black tree was the hardest one I did. It's certainly harder than splay, AVL (height or balance factor based), scapegoat, and AA trees.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
O_o
Are we talking general purpose? Or any tree structure of any kind?
*shrug*
I guess I'd say either a "RB" or differencing "B*Tree" with shared interior nodes (a "shadowing" tree).
Soma
Ive heard there were lots of different data structure trees, and yet I have not taken any classes yet on them, I am a little nervous because from what I have heard data structures and algorithms I and II are the hardest in the department for CS majors. any tips?
*wooosh*Nope! a diamond-wood tree would be the hardest, in my opinion
There are actually trees known as ironwood trees.
Quzah.
Hope is the first step on the road to disappointment.
O_o
*wooosh*
A lame joke is still a joke. Also, a link from your friendly neighborhood carpenter.
Soma
Diamond willow - Wikipedia, the free encyclopedia
Willows aren't hard wood. I know you have to disagree with everything I say just out of spite, but it doesn't make you right. Also, he said "diamond wood", not "diamond willow". There's no such thing as a "diamond wood tree". There are however ironwood trees.
Like I said, just disagreeing out of spite doesn't make you right.
Quzah.
Hope is the first step on the road to disappointment.
wikipedia is missing a entry on it.
Tree (data structure) - Wikipedia, the free encyclopedia
Edit: I guessed laserlight was joking; but you were not joking. I could be wrong. Maybe you were also joking.
Tim S.
Last edited by stahta01; 06-27-2011 at 05:24 PM.
/facepalm
*adds one more to the list of people here with no sense of humor*
Quzah.
Hope is the first step on the road to disappointment.
I got a sense of humor; your joke was not funny; therefore I did not think it was a joke.
Tim S.
It wasn't my joke. So not only do you not have a sense of humor, you can't follow a simple thread. You and phapp should form a humorless club, and then beat each other with it.
Quzah.
Hope is the first step on the road to disappointment.
I assume you're suggesting an ironwood club?You and phapp should form a humorless club, and then beat each other with it.
