Binary Trees make me sick :(

#21ISDcaptain01(Topic Creator)Posted 2/19/2013 1:29:55 AM
Forgot to add stacks and queues to the list
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123
#22SnakePawsPosted 2/19/2013 12:11:44 PM
-Dynamic arrays
-Dynamic multidimensional arrays
-Singly Linked List
-Doubly Linked List
-Bitvectors
-Hash tables
-General Trees
-Binary Trees
-Stacks
-Queues


This probably what you would find (if not more than that) in a data structures class at a typical university, by the way. If you're solid on all these then you'd probably have no problem in such a class.

At my school, even, data structures was just

- Lists (what operations they support, how different implementations give different time complexities, e.g., array-based lists vs linked lists)
- Stacks
- Queues
- Trees
- Binary Trees

Hash tables and balanced binary trees were not even mentioned.
#23Skel1Posted 2/19/2013 12:17:18 PM
When I went to school we definitely learned the more exhaustive list. Hash tables (maps) are probably my favorite datastructure ever. We all use them every single day, without ever giving thought of how awesome they are.
---
http://patrickavella.com/ <> I'm on the intertubes
http://twitter.com/patrickavella <> http://facebook.com/patrick.avella.blog
#24ForetakenPosted 2/19/2013 1:12:08 PM
It's worth noting you don't necessary need to memorize exactly how to build every data structure under the planet (though it wouldn't hurt.) What matters is to have a solid understanding as to how each works and when one should be used and shouldn't used.
---
[self release]
#25Skel1Posted 2/19/2013 1:24:25 PM
Foretaken posted...
It's worth noting you don't necessary need to memorize exactly how to build every data structure under the planet (though it wouldn't hurt.) What matters is to have a solid understanding as to how each works and when one should be used and shouldn't used.


The takeaway, is that they all, for the most part, work the same. They're just different ways of pointing pointers and traversing those pointers. Overly simplified, but that was the world as I saw it in academia. Almost everything is a linked list at its heart.
---
http://patrickavella.com/ <> I'm on the intertubes
http://twitter.com/patrickavella <> http://facebook.com/patrick.avella.blog
#26ISDcaptain01(Topic Creator)Posted 2/19/2013 1:50:33 PM
SnakePaws posted...
-Dynamic arrays
-Dynamic multidimensional arrays
-Singly Linked List
-Doubly Linked List
-Bitvectors
-Hash tables
-General Trees
-Binary Trees
-Stacks
-Queues


This probably what you would find (if not more than that) in a data structures class at a typical university, by the way. If you're solid on all these then you'd probably have no problem in such a class.

At my school, even, data structures was just

- Lists (what operations they support, how different implementations give different time complexities, e.g., array-based lists vs linked lists)
- Stacks
- Queues
- Trees
- Binary Trees

Hash tables and balanced binary trees were not even mentioned.

im only halfway through the book. We're still gonna cover priority queues, binary search trees, finate state machines, Hoffman algorithm, data compression, searching and sorting, and some more. At the end we make a small game and a map editior using the structures and algos
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123
#27chrisjrogersPosted 2/19/2013 8:48:20 PM
Word of advice, Don't panic or stress out. If you do you'll fail fast. Ask for help when able and needed to snap you out of your low points. The solo programmer in the job world is very unlikely so ask for help when you need it chances are some in the room can explain it better than others. :)
---
Reality can throw you some curve balls that statistics can't predict. Best be prepared for them. :)
#28ISDcaptain01(Topic Creator)Posted 2/19/2013 9:29:58 PM(edited)
chrisjrogers posted...
Word of advice, Don't panic or stress out. If you do you'll fail fast. Ask for help when able and needed to snap you out of your low points. The solo programmer in the job world is very unlikely so ask for help when you need it chances are some in the room can explain it better than others. :)


Stress and panic were the main reason I quit the CS major. My teacher was of no help, nor were my fellow students. Im pretty much hobby programming ever since, atleast theres no rush as I learn on my own time and pace now.
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123
#29ReconditePhreakPosted 2/20/2013 2:00:52 AM
Despite what skel seems to be implying, there are significant differences between the data structures, and you really need to understand those differences.
---
Believes the individuals who report to moderators wish they had more control than they do.
#30bob3rt24Posted 2/20/2013 2:36:45 PM(edited)
best advice for trees I can give is to put blinders on. Look to the left, look to the right keep going. Recursively. If you ever try to look at the large picture of the tree your brain will burst

Data Structures at my university consisted of

Algorithim Analysis
Vectors & templates
Linked List
Doubly LL
Stacks
Queues
Priority queues
Trees
Binary Search Tree
AVL Tree
Hash Table
Heaps
Graphs

Was a brain melter when I paired that with assembly programming. Was Really interesting. The tests were murder though.
---
I've lost my charge, I've been degaussed.
I'm on my own, I've been degaussed.