Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have a binary tree, it is strange: the root is the highest number, and the other go decreasing…
(Example: Huffman tree)
I need to make an algorithm that searches a key inside it.
I tried a lot but I had no idea how to do it =(
Any suggestion please?
For example like this
The tree in the image you showed us is a Huffman Tree. The nodes inside this tree represent the number of occurrences of the keys under that node. A node gives you absolutely no information about the keys that can be found from that node.
As you have no information about the keys in a subtree, you have to go through the whole tree to find a key inside it.