java一个关于二叉树的简单编程题

微信公开课小程序热门讨论「java一个关于二叉树的简单编程题」最新回复-定义一个结点类：publicclassNode{privateintvalue;privateNodeleftNode;privateNoderightNode;publicNodegetRightNode(){returnrightNode;}publicvoidsetRightNode(NoderightNode){this.rightNode=rightNode;}publicintgetValue(){returnvalue;}publicvoidsetValue(intvalue){this.value=value;}publicNodegetLeftNode(){returnleftNode;}publicvoidsetLeftNode(NodeleftNode){this.leftNode=leftNode;}}初始化结点树：publicvoidinitNodeTree(){intnodeNumber;HashMapString,Integermap=newHashMapString,Integer();NodenodeTree=newNode();Scannerreader=newScanner(System.in);nodeNumber=reader.nextInt();for(inti=0;inodeNumber;i++){intvalue=reader.nextInt();Stringstr=reader.next();map.put(str,value);}if(map.containsKey(#)){intvalue=map.get(#);nodeTree.setValue(value);setChildNode(map,value,nodeTree);}preTraversal(nodeTree);}privatevoidsetChildNode(HashMapString,Integermap,intnodeValue,NodeparentNode){intvalue=0;if(map.containsKey(L+nodeValue)){value=map.get(L+nodeValue);NodeleftNode=newNode();leftNode.setValue(value);parentNode.setLeftNode(leftNode);setChildNode(map,value,leftNode);}if(map.containsKey(R+nodeValue)){value=map.get(R+nodeValue);NoderightNode=newNode();rightNode.setValue(value);parentNode.setRightNode(rightNode);setChildNode(map,value,rightNode);}}前序遍历该结点树：publicvoidpreTraversal(NodenodeTree){if(nodeTree!=null){System.out.print(nodeTree.getValue()+\t);preTraversal(nodeTree.getLeftNode());preTraversal(nodeTree.getRightNode());}}
先序遍历按根节点，左子树右子树的顺序遍历。这是以前写的示例，可以参考一下 更多有关「java一个关于二叉树的简单编程题」的疑问请扫码关注微信公开课+小程序！