java-binary-trees

Automatically exported from code.google.com/p/java-binary-trees

Problem description:

You need to process extremely large file contains string (user id, email, url) and priority number (count of activity, etc..) - output of that should be list with Xth strings with biggest priorities.

Answer:

fixed size sorted binary tree.

Discussion:

easiest/quickest solution to traverse add/remove values in the tree.

Solution:

Few different solution for binary trees:

• standard binary tree
• sorted binary tree
• fixed size sorted binary tree *adjusted binary tree (shuffled)
• self adjusted sorted binary tree (shuffled)

Check this article about shuffle tree http://www.clockandflame.com/media/ShuffleTree_Aug2009.pdf