Weight Balanced Tree - Implementation
From Wikipedia, the free encyclopedia
Weight Balanced Tree or a Weight Balanced Binary Tree
Weight Balanced Binary Tree is a binary tree where the most probable item is the root item. The left sub tree consists of items less than the root items ranking, not its probability.
I have to implement this tree, with insertion, search and delete functions. My tree should work only with int values.
But I didn't understand very well this tree, I have some questions about how this tree works.
1) How this tree deals with repeated values?
2) How it does the sort of the nodes? Wich are the conditions of the comparison? The weight or the value of the node?
Since now, I thanks to all of you that read this thread.
Any doubts about my problem let me know...
Paulo Vitor Lima