• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
ClaudeFleming

Red-Black Trees-> How to determine node colors at all times?

5 posts in this topic

Hi,

Sorry if I'm a little dense, but I'm learning data structures so that I can become more acquainted with the true beauty of computer science. I have a question about red-black trees. How do you determine which nodes are red, and which nodes are black? I watched a demo of a red-black tree being created, and on the right branches of the tree, all the nodes were black (at least I think they were), and that threw me off. Also, what's up with the red nodes? Are they just created to make the black nodes stay in their proper place?

Thanks,
Lee
0

Share this post


Link to post
Share on other sites
I don't know what book are you following, but Sedgewick have recently given some talks about left-leaning red-black trees ([url="http://www.cs.princeton.edu/~rs/talks/LLRB/08Penn.pdf"]here for example[/url]) which I think may be interesting if you are interested in learning about these trees. The left leaning part of his variant is an additional constraints in the colors of the tree which simplifies the code.
1

Share this post


Link to post
Share on other sites
I know, I have read it. But I already have a good college textbook on the subject. The author says they are nothing more than either 2-3 trees or 2-3-4 trees arranged differently. I spent $108.00 on two algorithm books simply because I enjoy the beauty of data organization so much, lol. I have the soul of an artist and the coordination of a troglodyte and the common sense of a bulldog. lol
0

Share this post


Link to post
Share on other sites
[quote name='ClaudeFleming' timestamp='1309321418' post='4828943']
they are nothing more than either 2-3 trees or 2-3-4 trees arranged differently.[/quote]Exactly what I was going to say. QFE

If you first understand 2-3-4 trees, then you only need to understand that red-black is just a more convenient way of representing them. Learn how 2-3-4 trees are built first. The key is that they are built bottom up, not top down.
0

Share this post


Link to post
Share on other sites
My new books have arrived. And in one of them, red-black trees are called left-leaning 2-3 trees. Why does the red link have to be left-leaning and why is it that the black-height remains constant so easily?
0

Share this post


Link to post
Share on other sites
You're actually describing an [url="http://en.wikipedia.org/wiki/AA_tree"]AA-Tree[/url] which is a specialised variant of the red-black tree. The general red-black tree can have red links on either side of a black node.

The black height remains constant because the tree is built bottom up, not top down. I.e. when you do an insert, you don't actually traverse directly to a leaf node and then do an insert. You actually insert into the root node, where if it were a 2-3 tree you'd then have a node with one more item in it, and if there were three items in the node then it is split.

If inserting the value 3 into a tree with one node containing items 1 and 2 i.e.[code][1,2][/code] then you can think of it as two steps, first inserting the item so that the tree looks like this: [code][1,2,3][/code] and then performing a split so that is looks like this:[code] [2]
/ \
[1] [3][/code]

From there you just need to represent those 2-3 nodes as a binary tree where a node with more than on item is represented as a red link to the rest of the 2-3 node.


As was said, if you understand 2-3 trees, you will understand red-black trees.
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0