java二叉树插入函数非递归

Question

我已经编写了一个代码，用于向二叉树插入一个元素的泛型类型，它是按其名称排序的。不要认为这是正确的。

public boolean insert(E e) { 
    BTNode temp = root; 
    if (root == null) { 
     root.setElement(e); 
    } 
    while (temp != null) 
    if (temp.element().getClass().getName().compareTo(e.getClass().getName()) < 0) { 
     temp = temp.getRight(); 
    } else { 
     temp = temp.getLeft(); 
    } 
    temp.setElement(e); 
    return true; 
} 

你能建议我更正吗？

Answer 1

一种插件，需要创建一个新的节点。我现在没有如何创建它们，因为我没有看到构造函数，但我建议沿着以下几点：

public boolean insert(E e) {   
    if (root == null) { 
     root = new BTNode(); 
     root.setElement(e); //how would this work with a null root? 
     return true; //that's it, we're done (when is this ever false by the way?) 
    } 
    BTNode current = root; 
    while (true) { //brackets! indenting is important for readabilty 
     BTNode parent=current; 
     if (current.element().getClass().getName().compareTo(e.getClass().getName()) < 0) { 
      current = current.getRight(); 
      if(current==null) { //we don't have a right node, need to make one 
       current = new BTNode(); 
       parent.setRight(current); 
       break; //we have a new node in "current" that is empty 
      } 
     } else { 
      current= current.getLeft(); 
      if(current==null) { //we don't have a left node, need to make one 
       current = new BTNode(); 
       parent.setLeft(current); 
       break; //we have a new node in "current" that is empty 
      } 
     } 
    } 
    current.setElement(e); 
    return true; 
} 

Answer 2

随着艾玛迪斯提到的，while循环不应该有一个分号结尾：

BTNode temp = root; 
    if (root == null) { 
     root.setElement(e); 
     return; 
    } 
    while (temp != null) 
    { 
     if (temp.element().getClass().getName().compareTo(e.getClass().getName()) < 0) { 
      if(temp.getRight() != null) 
      temp = temp.getRight(); 
      else 
      { 
       temp.createRight(e); 
       temp = null; //or break 
      } 
     } else { 
      if(temp.getLeft() != null) 
      temp = temp.getLeft(); 
      else 
      { 
       temp.createLeft(e); 
       temp = null; //or break 
      } 
     } 
    } 

    return true;