如何在jtreeJavaSwing中显示二进制树

我有二叉树类，当然还有节点类

public class Node {
     SomeClass somedata;
     Node leftChld;
     Node rightChld;
}

我需要在JTree swing gui组件中显示我的二进制文件。请举例说明如何做到这一点。 Thx提前

对不起，这个话题是我自己做的 给你

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

给你

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

给你

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

 public void showInTree(DefaultMutableTreeNode rtCm,BNode rt){
  if (rt!=null) {
    StringBuilder str = new StringBuilder(String.valueOf(rt.numVal));
    if (rt.chVal!='\0'){
        str.append("--" + "(").append(String.valueOf(rt.chVal)).append(")");
    }
     DefaultMutableTreeNode newnode = new DefaultMutableTreeNode(str);
    rtCm.add(newnode);
    if (rt.leftBNode != null) {
        showInTree(newnode, rt.leftBNode);
}   
    if (rt.rightBNode!=null) {
        showInTree(newnode,rt.rightBNode);
    }
  }
}

---

可能你可以从中得到一些逻辑：-）回答你自己的问题应该通过添加答案（见下文）而不是编辑问题来完成。可能你可以从中得到一些逻辑：-）回答你自己的问题应该通过添加答案（见下文）而不是编辑问题来完成。