Program to check if heap order is correct or not

up vote
0
down vote

favorite

There is a Java program to check if a Heap (Min) is in the correct order. Heap Order means the parent is less than both left child and right child.

package testers;



import heap.Heap;

import java.util.List;



public class HeapTester

{

    public static void main(String args)

    {

        Heap<Integer> heap = new Heap <>();

        heap.add(50);

        heap.add(25);

        heap.add(26);

        heap.add(15);

        heap.add(10);

        heap.add(16);

        heap.add(3);

        heap.add(7);

        heap.add(10);

        heap.add(12);

        heap.add(2);

        System.out.println(heap);

        System.out.println(hasHeapOrder(heap.copy()));

    }



    private static <T extends Comparable<T>> boolean hasHeapOrder(List<T> list)

    {

        if(list.size() < 2) return true;



        boolean hasOrder = true;



        int parent = 0;

        int leftChild = 2 * parent + 1;

        int rightChild = 2 * parent + 2;



        while(leftChild < list.size())

        {

            if(list.get(parent).compareTo(list.get(leftChild)) > 0)

            {

                hasOrder = false;

                break;

            }

            if(rightChild < list.size())

            {

            if(list.get(parent).compareTo(list.get(rightChild)) > 0)

                {

                    hasOrder = false;

                    break;

                }

            }



            parent++;

            leftChild = 2 * parent + 1;

            rightChild = 2 * parent + 2;

        }

        return hasOrder;

    }  

}

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

add a comment |

up vote
0
down vote

favorite

There is a Java program to check if a Heap (Min) is in the correct order. Heap Order means the parent is less than both left child and right child.

package testers;



import heap.Heap;

import java.util.List;



public class HeapTester

{

    public static void main(String args)

    {

        Heap<Integer> heap = new Heap <>();

        heap.add(50);

        heap.add(25);

        heap.add(26);

        heap.add(15);

        heap.add(10);

        heap.add(16);

        heap.add(3);

        heap.add(7);

        heap.add(10);

        heap.add(12);

        heap.add(2);

        System.out.println(heap);

        System.out.println(hasHeapOrder(heap.copy()));

    }



    private static <T extends Comparable<T>> boolean hasHeapOrder(List<T> list)

    {

        if(list.size() < 2) return true;



        boolean hasOrder = true;



        int parent = 0;

        int leftChild = 2 * parent + 1;

        int rightChild = 2 * parent + 2;



        while(leftChild < list.size())

        {

            if(list.get(parent).compareTo(list.get(leftChild)) > 0)

            {

                hasOrder = false;

                break;

            }

            if(rightChild < list.size())

            {

            if(list.get(parent).compareTo(list.get(rightChild)) > 0)

                {

                    hasOrder = false;

                    break;

                }

            }



            parent++;

            leftChild = 2 * parent + 1;

            rightChild = 2 * parent + 2;

        }

        return hasOrder;

    }  

}

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

add a comment |

up vote
0
down vote

favorite

There is a Java program to check if a Heap (Min) is in the correct order. Heap Order means the parent is less than both left child and right child.

package testers;



import heap.Heap;

import java.util.List;



public class HeapTester

{

    public static void main(String args)

    {

        Heap<Integer> heap = new Heap <>();

        heap.add(50);

        heap.add(25);

        heap.add(26);

        heap.add(15);

        heap.add(10);

        heap.add(16);

        heap.add(3);

        heap.add(7);

        heap.add(10);

        heap.add(12);

        heap.add(2);

        System.out.println(heap);

        System.out.println(hasHeapOrder(heap.copy()));

    }



    private static <T extends Comparable<T>> boolean hasHeapOrder(List<T> list)

    {

        if(list.size() < 2) return true;



        boolean hasOrder = true;



        int parent = 0;

        int leftChild = 2 * parent + 1;

        int rightChild = 2 * parent + 2;



        while(leftChild < list.size())

        {

            if(list.get(parent).compareTo(list.get(leftChild)) > 0)

            {

                hasOrder = false;

                break;

            }

            if(rightChild < list.size())

            {

            if(list.get(parent).compareTo(list.get(rightChild)) > 0)

                {

                    hasOrder = false;

                    break;

                }

            }



            parent++;

            leftChild = 2 * parent + 1;

            rightChild = 2 * parent + 2;

        }

        return hasOrder;

    }  

}

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

There is a Java program to check if a Heap (Min) is in the correct order. Heap Order means the parent is less than both left child and right child.

package testers;



import heap.Heap;

import java.util.List;



public class HeapTester

{

    public static void main(String args)

    {

        Heap<Integer> heap = new Heap <>();

        heap.add(50);

        heap.add(25);

        heap.add(26);

        heap.add(15);

        heap.add(10);

        heap.add(16);

        heap.add(3);

        heap.add(7);

        heap.add(10);

        heap.add(12);

        heap.add(2);

        System.out.println(heap);

        System.out.println(hasHeapOrder(heap.copy()));

    }



    private static <T extends Comparable<T>> boolean hasHeapOrder(List<T> list)

    {

        if(list.size() < 2) return true;



        boolean hasOrder = true;



        int parent = 0;

        int leftChild = 2 * parent + 1;

        int rightChild = 2 * parent + 2;



        while(leftChild < list.size())

        {

            if(list.get(parent).compareTo(list.get(leftChild)) > 0)

            {

                hasOrder = false;

                break;

            }

            if(rightChild < list.size())

            {

            if(list.get(parent).compareTo(list.get(rightChild)) > 0)

                {

                    hasOrder = false;

                    break;

                }

            }



            parent++;

            leftChild = 2 * parent + 1;

            rightChild = 2 * parent + 2;

        }

        return hasOrder;

    }  

}

java generics heap

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

edited 1 hour ago

mdfst13

17.1k52155

edited 1 hour ago

mdfst13

17.1k52155

edited 1 hour ago

mdfst13

17.1k52155

asked 1 hour ago

Hamidur Rahman

486

asked 1 hour ago

Hamidur Rahman

486

asked 1 hour ago

Hamidur Rahman

486

add a comment |

active

oldest

votes

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

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: "196"
};
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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
});

}
});

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f209778%2fprogram-to-check-if-heap-order-is-correct-or-not%23new-answer', 'question_page');
}
);

Post as a guest

Name

Required, but never shown

active

oldest

votes

draft saved

draft discarded

Thanks for contributing an answer to Code Review Stack Exchange!

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.

Use MathJax to format equations. MathJax reference.

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.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Name

Required, but never shown

Name

Required, but never shown

This page is only for reference, If you need detailed information, please check here

搜尋此網誌

Krdytkyu