Saturday, February 18, 2012

Red Black Tree

Discuss Red Black Tree and its application

Propose a tree based data structure to identify a node with nth rank with maximum efficiency 

Hint:Use a red-black tree with size of subtree as another element in the structure of each node.
size(node) = size(node->left)+sizeof(node->right)+1;

No comments:

Post a Comment