1 Star 0 Fork 0

besti1923/JAVA

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
cn/edu/besti/jyf1923/G2309
shiyan8_1
shiyan8_2
shiyan8_3
shiyan8_4
test1
2.txt
3
3.txt
ArrayStack.java
ArrayStackADT.java
ArrayStackTest.java
BinaryTree.java
BinaryTreeNode.java
BinaryTreeTest.java
Calculate.java
Compareable.java
CreateBinaryTree.java
Dec_RSA.java
DigestPass.java
DijstraAlgorithm.java
DirectedGraph.java
Edge.java
Enc_RSA.dat
Enc_RSA.java
Graph.java
GraphLoopTest.java
HaffNode.java
HaffTree.java
Hello.java
Hellojdb.java
KerAgree.java
Key_DH.java
Linked.java
MyUtil.java
MyUtilTest.java
Node.java
Plural.java
Prim.java
README.md
RationalNumberCalculator.java
SDec.java
SEnc.dat
SEnc.java
SearchTest.java
Server3.java
Skey_DES.java
Skey_RSA.java
Skey_RSA_priv.dat
Skey_RSA_pub.dat
Skey_kb.java
StringBufferDemo.java
StringBufferDemoTest.java
TestTopoSort.java
Vertex.java
a.java
animals.java
animalsTest.java
arraylist.java
b.java
c.java
calculator.java
calculatorTest.java
client.java
client2.java
complex_number.java
complex_number2.java
complex_number2Test.java
fenshu.java
file1.txt
file2.txt
file3.txt
filetest.java
hero.java
heroTest.java
kaser.java
key1.dat
keykb1.dat
linkedlisttexample1923.java
mycomplex.java
mycomplexTest.java
searching.java
server.java
server2.java
sheep.java
shiyan6.java
shiyan6_1.java
shiyan6_2.java
soldiers.java
sortTest.java
sorting.java
stack_test.java
student1.java
test.iml
test.java
test3.java
test7.java
text.java
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
BinaryTree.java 1.15 KB
一键复制 编辑 原始数据 按行查看 历史
yifei 提交于 5年前 . seven experiment
package text.java;
public class BinaryTree {
Compareable tree = new Compareable(-1);
Compareable head = new Compareable(-1);
int[] a = new int[12];
public BinaryTree()
{
head.setNext(tree);
}
public void s(int[] b)
{
tree.setI(b[0]);
for(int i=1;i<b.length;i++)
{
Compareable c = new Compareable(b[i]);
tree = head.getNext();
while (tree.geti()!=b[i])
{
if(tree.geti()<b[i]&&(tree.getNext()!=null))
{
tree = tree.getNext();
}
else if(tree.geti()<b[i]&&tree.getNext()==null)
{
tree.setNext(c);
tree=c;
}
else if(tree.geti()>b[i]&&tree.getSecondnext()!=null)
tree = tree.getSecondnext();
else if(tree.geti()>b[i]&&tree.getSecondnext()==null)
{
tree.setSecondnext(c);
tree = c;
}
}
}
}
public Compareable get()
{
return head.getNext();
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/besti1923/java.git
git@gitee.com:besti1923/java.git
besti1923
java
JAVA
master

搜索帮助