O_O
[Forum Game] Paste whatever's on your clipboard!
EpicNecros
#1724
a lot of code
import java.io.;
import java.util.;
import java.lang.Math.*;
import java.lang.StringBuilder;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
public class BinaryTree {
public static int lineNumber=0;
private static final String FILE = "./classlistshort";
public static int pos = 0;
public static void main(String args[]){
BufferedReader br = null;
FileReader fr = null;
try {
br = new BufferedReader(new FileReader(FILE));
fr = new FileReader(FILE);
br = new BufferedReader(fr);
String sCurrentLine;
while ((sCurrentLine = br.readLine()) != null) {
lineNumber++;
// System.out.println(sCurrentLine); for testing filereader
} // - while ((sCurrentLine = br.readLine()) != null) {
} // - try {}
catch (IOException e) {
e.printStackTrace();
} // - catch
finally {
try {
if (br != null)
br.close();
if (fr != null)
fr.close();
} // - try
catch (IOException ex) {
ex.printStackTrace();
} // - catch
} // - finally
String binList[] = new String[lineNumber];
br = null;
fr = null;
String randArray[] = new String[lineNumber];
try {
br = new BufferedReader(new FileReader(FILE));
fr = new FileReader(FILE);
br = new BufferedReader(fr);
String sCurrentLine;
int currentLine = 0;
while ((sCurrentLine = br.readLine()) != null) {
// System.out.println(sCurrentLine); for testing filereader
randArray[currentLine] = sCurrentLine;
currentLine++;
} // - while ((sCurrentLine = br.readLine()) != null) {
} // - try {}
catch (IOException e) {
e.printStackTrace();
} // - catch
finally {
try {
if (br != null)
br.close();
if (fr != null)
fr.close();
} // - try
catch (IOException ex) {
ex.printStackTrace();
} // - catch
} // - finally
for (int i = 0; i < binList.length; i++) {
binList[i] = randArray[i];
} // - for (int i = 0; i < binList.length; i++) {}
Collections.shuffle(Arrays.asList(binList));
System.out.println(binList[0]);
System.out.println(binList[1]);
Root r;
r = new Root();
r.root = new Node(binList[0],binList[0],binList[0],1);
int ind = 1;
while(ind < binList.length) {
System.out.println(ind);
Node tmpR = new Node(binList[ind],binList[ind],binList[ind],ind);
AddNode(ind, tmpR, r.root);
ind++;
}
StoreList(r.root);
} // - public static void main(String args[]){}
public static void AddNode(int index, Node addedNode, Node root){
Node curr = root;
String bin;
bin = toBinary(index);
int stringLength = toBinary(index).length();
for(int p = 1; p < stringLength; p++){
if(String.valueOf(bin.charAt(p)).equals("0")) {
// System.out.print(curr.lastName.trim() + " ");
if(curr.left==null){curr.left = addedNode; System.out.print("yes ");}
else {
curr = curr.left;
System.out.print(bin.charAt(p) + "left ");
}
}
else if(String.valueOf(bin.charAt(p)).equals("1")) {
// System.out.print(curr.lastName + " ");
if(curr.right==null){curr.right = addedNode; System.out.print("yes ");}
else {
curr = curr.right;
System.out.print(bin.charAt(p) + "right ");
}
};
}
System.out.println(curr.lastName);
}
// public static void PrintTree(Node root, int maxSize){
// for(int tracker = 2; tracker <= maxSize; tracker++) {
// int currentIndex = 2;
// Node curr = root;
// while(currentIndex <= tracker){
// if(toBinary(currentIndex).equals(0)) {
// curr = curr.left;
// }
// else{
// curr = curr.right;
// }
// currentIndex++;
// }
// System.out.println(curr.lastName);
// }
// }
public static void TraverseAll(Node tmp, ListElement tmpL){
System.out.println(tmp.index + " " + tmp.lastName);
tmpL.lastName = tmp.lastName;
tmpL.firstName = tmp.lastName;
tmpL.id = tmp.lastName;
tmpL.next = new ListElement("","","");
if(tmp.left!=null) {
TraverseAll(tmp.left, tmpL.next);
}
if(tmp.right!=null) {
TraverseAll(tmp.right, tmpL.next);
}
}
public static void StoreList(Node tmp) {
Head h = new Head();
h.head = new ListElement("","","");
TraverseAll(tmp, h.head);
}
public static String toBinary(int n) {
if (n == 0) {
return "0";
}
String binary = "";
while (n > 0) {
int rem = n % 2;
binary = rem + binary;
n = n / 2;
}
return binary;
}
} // - public class BinaryTree {}
note - even if you figured out how to work it, the code has external classes it uses so you canât use it without that code too :^)
EpicNecros
#1727
idk because processing speed
that note was mostly about the functionality of said tree
@sxplorer proj, not for fun
i much prefer just to use linkedlists sorted using some sort of array or table
Cutecoco
#1735
Please buy now because now until May 30th we have a great deal! After purchasing one book set from me for every additional set you buy you get a 5% discount on your whole purchase (Max 15% discount)!
