package DataStructure;
import java.util.Stack;
public class BiTree {//这个代ç 是错的，目å‰èƒ½åŠ›ä¸è¶³ï¼Œæ— æ³•çº æ£ 2022.3.24
public class Node {
private Object value;
private Node left;
private Node right;
public Node(){}
public Node(Object value,Node left,Node right) {
this.value = value;
this.left = left;
this.right = right;
}
public Node(Object value){
this.value = value;
}
public Object getValue() {
return value;
}
public Node getLeft() {
return left;
}
public Node getRight() {
return right;
}
public void setValue(Object value) {
this.value = value;
}
public void setLeft(Node left) {
this.left = left;
}
public void setRight(Node right) {
this.right = right;
}
}
private Node root;
private int index = 0;
public BiTree(String str) {//å…ˆåºéåŽ†å»ºæ ‘ ç›´æŽ¥å†™åœ¨æž„é€ æ–¹æ³•é‡Œï¼Œå’ŒC++ä¸ä¸€æ ·
char c = str.charAt(index++);
if(c != '#'){
root = new Node(c);
root.left = new BiTree(str).root;
root.right = new BiTree(str).root;
} else root = null;//æž„é€ å‡½æ•°å“ªæœ‰è¿”å›žå€¼
}
public void preRootTraverse(){
Node T = root;
if(T != null) {
Stack