How to construct Huffman Tree from preorder scan?
up vote
0
down vote
favorite
I'm a little confused about how to build a Huffman tree from a preorder scan. I encoded my header similar to how it was explained here
But I'm not entirely sure how to read the scan and build the tree, my scan looks like this
01a001c1b001f1e1d# (the hashtag is for breaking out of the loop)
This is my attempt to build the tree, though it's not quite right
HuffmanNode rootTest=new HuffmanNode((byte)preOrderString.charAt(0));
Stack<HuffmanNode> s = new Stack<HuffmanNode>();
HuffmanNode current=rootTest;
root=current;
s.push(current);
for(int i=1;i<preOrderString.length();i++) {
if(preOrderString.charAt(i)=='0') {
HuffmanNode next=new HuffmanNode((byte)preOrderString.charAt(i));
if(current.left==null)
current.left=next;
else
current.right=next;
current=next;
System.out.println(current);
s.push(current);
}
if(preOrderString.charAt(i)=='1') {
i++;
if(current.left==null) {
current.left=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("left "+current.left);
}
else if(current.right==null){
current.right=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("right "+current.right);
}
while(!s.isEmpty()) {
current=s.pop();
}
}
}
java huffman-code
asked Nov 12 at 7:55
TheHaruWhoCodes
207
add a comment |
up vote
0
down vote
favorite
I'm a little confused about how to build a Huffman tree from a preorder scan. I encoded my header similar to how it was explained here
But I'm not entirely sure how to read the scan and build the tree, my scan looks like this
01a001c1b001f1e1d# (the hashtag is for breaking out of the loop)
This is my attempt to build the tree, though it's not quite right
HuffmanNode rootTest=new HuffmanNode((byte)preOrderString.charAt(0));
Stack<HuffmanNode> s = new Stack<HuffmanNode>();
HuffmanNode current=rootTest;
root=current;
s.push(current);
for(int i=1;i<preOrderString.length();i++) {
if(preOrderString.charAt(i)=='0') {
HuffmanNode next=new HuffmanNode((byte)preOrderString.charAt(i));
if(current.left==null)
current.left=next;
else
current.right=next;
current=next;
System.out.println(current);
s.push(current);
}
if(preOrderString.charAt(i)=='1') {
i++;
if(current.left==null) {
current.left=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("left "+current.left);
}
else if(current.right==null){
current.right=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("right "+current.right);
}
while(!s.isEmpty()) {
current=s.pop();
}
}
}
java huffman-code
asked Nov 12 at 7:55
TheHaruWhoCodes
207
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I'm a little confused about how to build a Huffman tree from a preorder scan. I encoded my header similar to how it was explained here
But I'm not entirely sure how to read the scan and build the tree, my scan looks like this
01a001c1b001f1e1d# (the hashtag is for breaking out of the loop)
This is my attempt to build the tree, though it's not quite right
HuffmanNode rootTest=new HuffmanNode((byte)preOrderString.charAt(0));
Stack<HuffmanNode> s = new Stack<HuffmanNode>();
HuffmanNode current=rootTest;
root=current;
s.push(current);
for(int i=1;i<preOrderString.length();i++) {
if(preOrderString.charAt(i)=='0') {
HuffmanNode next=new HuffmanNode((byte)preOrderString.charAt(i));
if(current.left==null)
current.left=next;
else
current.right=next;
current=next;
System.out.println(current);
s.push(current);
}
if(preOrderString.charAt(i)=='1') {
i++;
if(current.left==null) {
current.left=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("left "+current.left);
}
else if(current.right==null){
current.right=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("right "+current.right);
}
while(!s.isEmpty()) {
current=s.pop();
}
}
}
java huffman-code
asked Nov 12 at 7:55
TheHaruWhoCodes
207
I'm a little confused about how to build a Huffman tree from a preorder scan. I encoded my header similar to how it was explained here
But I'm not entirely sure how to read the scan and build the tree, my scan looks like this
01a001c1b001f1e1d# (the hashtag is for breaking out of the loop)
This is my attempt to build the tree, though it's not quite right
HuffmanNode rootTest=new HuffmanNode((byte)preOrderString.charAt(0));
Stack<HuffmanNode> s = new Stack<HuffmanNode>();
HuffmanNode current=rootTest;
root=current;
s.push(current);
for(int i=1;i<preOrderString.length();i++) {
if(preOrderString.charAt(i)=='0') {
HuffmanNode next=new HuffmanNode((byte)preOrderString.charAt(i));
if(current.left==null)
current.left=next;
else
current.right=next;
current=next;
System.out.println(current);
s.push(current);
}
if(preOrderString.charAt(i)=='1') {
i++;
if(current.left==null) {
current.left=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("left "+current.left);
}
else if(current.right==null){
current.right=new HuffmanNode((byte)preOrderString.charAt(i));
System.out.println("right "+current.right);
}
while(!s.isEmpty()) {
current=s.pop();
}
}
}
java huffman-code
java huffman-code
asked Nov 12 at 7:55
TheHaruWhoCodes
207
asked Nov 12 at 7:55
TheHaruWhoCodes
207
edited Nov 12 at 17:07
asked Nov 12 at 7:55
TheHaruWhoCodes
207
asked Nov 12 at 7:55
TheHaruWhoCodes
207
asked Nov 12 at 7:55
TheHaruWhoCodes
207
207
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
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%2f53257886%2fhow-to-construct-huffman-tree-from-preorder-scan%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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%2f53257886%2fhow-to-construct-huffman-tree-from-preorder-scan%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
