priortyQueue (BST using array)

http://www.edwith.org/datastructure-2017f/lecture/13960/

마찬가지

package priortyQueue;

public class BinarySearchTree {

public static Node[] bst;

public static void main(String[] args) {

bst = new Node[mypow(5)];

enqueue("김대중", 10);

enqueue("박근혜", 3);

enqueue("노무현", 9);

enqueue("이명박", 9);

enqueue("문재인", 2);

inorderPrintTree(1);

}

private static int mypow(int i) {

int returnInt = 1;

for (int j = 0; j < i; j++) {

returnInt *= 2;

}

return returnInt;

}

private static void enqueue(String name, int priority) {

tree(name, priority, 1);

}

private static void tree(String name, int priority, int i) {

while (bst[i] != null) {

if (bst[i].Priority < priority) {

i = 2 * i;

} else {

i = 2 * i + 1;

}

}

bst[i] = new Node(name, priority);

}

public static void inorderPrintTree(int i) {

if (bst[i] == null) {

return;

}

inorderPrintTree(i * 2);

System.out.print(bst[i]);

inorderPrintTree(i * 2 + 1);

}

public static class Node {

String Name;

int Priority;

public Node(String name, int priority) {

Name = name;

Priority = priority;

}

public String toString() {

return "[" + Name + ", " + Priority + "]";

}

}

}