trying to concat characters in a huffman type tree
up vote
0
down vote
favorite
I have to create BST where each node contains a unique character and its weight. After displaying whats inside the tree once, the two nodes with the smallest weight combine together and the two characters join and the weights add up. The problem that im running into is that I cant combine the two characters since they are chars. Is there another way of implementing this? This is what i have for my insert, value being the character being inserted and the data as the current character in the node
public void insert(char value)
{
if(value < data)
{
if(leftChild == null)
{
leftChild = new Node(value);
}
else
{
leftChild.insert(value);
}
}
else if( value > data)
{
if(rightChild == null)
{
rightChild = new Node(value);
}
else
{
rightChild.insert(value);
}
}
else if( value == data)
{
counter+=1;
}
}
java binary-search-tree
asked Nov 22 at 7:18
Jorge
1
add a comment |
up vote
0
down vote
favorite
I have to create BST where each node contains a unique character and its weight. After displaying whats inside the tree once, the two nodes with the smallest weight combine together and the two characters join and the weights add up. The problem that im running into is that I cant combine the two characters since they are chars. Is there another way of implementing this? This is what i have for my insert, value being the character being inserted and the data as the current character in the node
public void insert(char value)
{
if(value < data)
{
if(leftChild == null)
{
leftChild = new Node(value);
}
else
{
leftChild.insert(value);
}
}
else if( value > data)
{
if(rightChild == null)
{
rightChild = new Node(value);
}
else
{
rightChild.insert(value);
}
}
else if( value == data)
{
counter+=1;
}
}
java binary-search-tree
asked Nov 22 at 7:18
Jorge
1
1
Use aStringinstead of achar?
– Robby Cornelissen
Nov 22 at 7:27
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I have to create BST where each node contains a unique character and its weight. After displaying whats inside the tree once, the two nodes with the smallest weight combine together and the two characters join and the weights add up. The problem that im running into is that I cant combine the two characters since they are chars. Is there another way of implementing this? This is what i have for my insert, value being the character being inserted and the data as the current character in the node
public void insert(char value)
{
if(value < data)
{
if(leftChild == null)
{
leftChild = new Node(value);
}
else
{
leftChild.insert(value);
}
}
else if( value > data)
{
if(rightChild == null)
{
rightChild = new Node(value);
}
else
{
rightChild.insert(value);
}
}
else if( value == data)
{
counter+=1;
}
}
java binary-search-tree
asked Nov 22 at 7:18
Jorge
1
I have to create BST where each node contains a unique character and its weight. After displaying whats inside the tree once, the two nodes with the smallest weight combine together and the two characters join and the weights add up. The problem that im running into is that I cant combine the two characters since they are chars. Is there another way of implementing this? This is what i have for my insert, value being the character being inserted and the data as the current character in the node
public void insert(char value)
{
if(value < data)
{
if(leftChild == null)
{
leftChild = new Node(value);
}
else
{
leftChild.insert(value);
}
}
else if( value > data)
{
if(rightChild == null)
{
rightChild = new Node(value);
}
else
{
rightChild.insert(value);
}
}
else if( value == data)
{
counter+=1;
}
}
java binary-search-tree
java binary-search-tree
asked Nov 22 at 7:18
Jorge
1
asked Nov 22 at 7:18
Jorge
1
asked Nov 22 at 7:18
Jorge
1
asked Nov 22 at 7:18
Jorge
1
asked Nov 22 at 7:18
Jorge
1
1
1
Use aStringinstead of achar?
– Robby Cornelissen
Nov 22 at 7:27
add a comment |
1
Use aStringinstead of achar?
– Robby Cornelissen
Nov 22 at 7:27
1
1
Use a
String instead of a char?– Robby Cornelissen
Nov 22 at 7:27
Use a
String instead of a char?– Robby Cornelissen
Nov 22 at 7:27
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53425687%2ftrying-to-concat-characters-in-a-huffman-type-tree%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Use a
Stringinstead of achar?– Robby Cornelissen
Nov 22 at 7:27