|
[x]
Posted via EE Mobile
|
||
Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again. |
||
| Question |
|
[x]
Attachment Details
|
||
|
[x]
The Solution Rating System
|
||
With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.
Your Input Matters If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support. Thank you! |
||
1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12: 13: 14: 15: 16: 17: 18: 19: 20: 21: 22: 23: 24: 25: 26: 27: 28: 29: 30: 31: 32: 33: 34: 35: 36: 37: 38: 39: 40: 41: 42: 43: 44: 45: 46: 47: 48: 49: 50: 51: 52: 53: 54: 55: 56: 57: 58: 59: 60: 61: 62: 63: 64: 65: 66: 67: 68: 69: 70: 71: 72: 73: 74: 75: 76: 77: 78: 79: 80: 81: 82: 83: 84: 85: 86: 87: 88: 89: 90: 91: 92: 93: 94: 95: 96: 97: 98: 99: 100: 101: 102: 103: 104: 105: 106: 107: 108: 109: 110: 111: |
package courseWork;
import java.io.*;
import java.util.*;
/*
* This is a tree class
*/
public class BstNode {
private String name;
private static Date dateOfBirth;
public static Object root;
private BstNode left;
private BstNode right;
public static void main(String[] args) throws IOException {//this is the main method of this class
insert();
/*
System.out.println("Please insert the element that you want to find it ");
Scanner scanner = new Scanner (System.in);
String value = scanner.nextLine();
*/
}
public BstNode(String name, Date dateOfBirth) { //this is a contrast of this class
this.name = name;
this.dateOfBirth = dateOfBirth;
}
public void insert(BstNode node) { // this method just for decleir the tree
if (this.name.compareTo(node.name) > 0) {
if (left == null) {
left = node;
} else {
left.insert(node);
}
} else {
if (right == null) {
right = node;
} else {
right.insert(node);
}
}
}
public void print() {
if (left != null) {
left.print();
}
System.out.println(name);
if (right != null) {
right.print();
}
}
public static void insert() throws IOException{ // this method for insert from file into tree
File inputFile = new File("data.txt");
Scanner reader = new Scanner ( inputFile);
BstNode root = new BstNode("", dateOfBirth);
while(reader.hasNext()){
root.insert(new BstNode(reader.nextLine(), dateOfBirth));
root.print();
System.out.println("------------------------------");
}
}
//*********************************************************************
// This is method of find birth day if i insert name
public boolean find (BstNode node) { // this method just for decleir the tree
/*
System.out.println("Please insert the element that you want to find it ");
Scanner scanner = new Scanner (System.in);
String value = scanner.nextLine();
*/
if (this.name.compareTo(node.name) > 0) {
if (left == null) {
left = node;
} else {
return true;
}
} else {
if (right == null) {
right = node;
} else {
right.insert(node);
}
}
return true;
}
//******************************************************************
}
|
Advertisement
| Hall of Fame |