Binary Trees make me sick :(

#11ReconditePhreakPosted 2/15/2013 5:14:19 PM
I saw a kid collapse once while doing a breadth first reverse gnodab lookup traversal. I saw him a few months later, he had a twitchy eyebrow and was a telecom major.
---
Believes the individuals who report to moderators wish they had more control than they do.
#12ISDcaptain01(Topic Creator)Posted 2/15/2013 7:57:48 PM
ReconditePhreak posted...
I saw a kid collapse once while doing a breadth first reverse gnodab lookup traversal. I saw him a few months later, he had a twitchy eyebrow and was a telecom major.


I dont blame him lol
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123
#13ReconditePhreakPosted 2/16/2013 3:44:01 AM
That was meant to be a joke, but just in case, there is no such thing as a breadth first gnodab lookup traversal, lol.

No reason to scare you more than necessary, muahahahaha *followed by dr evil laugh*
---
Believes the individuals who report to moderators wish they had more control than they do.
#14BewmHedshotPosted 2/16/2013 9:45:15 AM
Recursion is for children, try to write an iterative tree traversal and your brain will really hurt
---
Money may not buy happiness, but I'll take my ****ing chances.
#15General_ZimbadPosted 2/17/2013 1:56:53 AM
^ Have tried because wanted to avoid recursion. Ended up using recursion.
#16nesisPosted 2/17/2013 4:45:02 PM
Is it just me or is it often easier solving a problem recursively, then refactoring it to an iterative solution than it is just writing the iterative solution off the bat?
---
|_|\\ ||'E_ I__|
|_|| \\|_S_S_|
#17BewmHedshotPosted 2/17/2013 4:47:56 PM
It's usually easier to refactor working solutions than create new solutions, yes.
---
Money may not buy happiness, but I'll take my ****ing chances.
#18CC RicersPosted 2/18/2013 10:24:51 AM
Make a binary tree with a typical flat array and use bitwise tricks to get around the tree.

http://www.gamasutra.com/features/20000403/turner_04.gif
---
Those loonies are gonna blow up the ocean
#19Skel1Posted 2/18/2013 11:19:40 AM
BewmHedshot posted...
Recursion is for children, try to write an iterative tree traversal and your brain will really hurt


I actually accomplished this, painstakingly. It was inneffecient and moronic, but the professor dared me :P
---
http://patrickavella.com/ <> I'm on the intertubes
http://twitter.com/patrickavella <> http://facebook.com/patrick.avella.blog
#20ISDcaptain01(Topic Creator)Posted 2/19/2013 1:18:50 AM
Yeah all these data structures are making me sick lol. Heres the ones I learned

-Dynamic arrays
-Dynamic multidimensional arrays
-Singly Linked List
-Doubly Linked List
-Bitvectors
-Hash tables
-General Trees
-Binary Trees

and some basic algorithm analysis. It feels like sorcery lol. Im not sure if I can remember all the syntax for them. Meh, everyone uses STL anyways.
---
lol at --> http://boards.gamefaqs.com/gfaqs/user.php?=89123