二叉树算法

packagebinary_tree;

 

/**

 *@authorzhou shengshuai

 *

 */

classNodes {

    intvalue;

    Nodes leftN;

    Nodes rightN;

 

    publicNodes(int value) {

          this.value = value;

    }

 

    publicvoiddisplayNodes() {

          System.out.println(value);

    }

}

 

classTrees {

    privateNodesroot;

 

    publicTrees() {

          this.root =null;

    }

 

    publicvoidinsert(Nodes node) {

          if(root ==null) {

              root = node;

          } else{

              Nodes current =root;

 

              while (current !=null) {

                   if(node.value < current.value) {

                       if (current.leftN ==null) {

                             current.leftN = node;

                             break;

                       } else {

                             current= current.leftN;

                       }

                   } else{

                       if (current.rightN ==null) {

                             current.rightN= node;

                             break;

                       } else {

                             current= current.rightN;

                       }

                   }

              }

 

          }

    }

 

}

 

publicclassTreeTest {

 

    /**

     *@paramargs

     */

    publicstaticvoidmain(String[] args) {

          Trees ts = newTrees();

 

          ts.insert(newNodes(50));

          ts.insert(newNodes(20));

          ts.insert(newNodes(80));

          ts.insert(newNodes(60));

          ts.insert(newNodes(90));

          ts.insert(newNodes(30));

          ts.insert(newNodes(40));

          ts.insert(newNodes(70));

          ts.insert(newNodes(100));

          ts.insert(newNodes(10));

    }

 

}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值