java非递归生成树及遍历

最新推荐文章于 2024-10-05 15:50:32 发布

菜谱

最新推荐文章于 2024-10-05 15:50:32 发布

阅读量3.8k

点赞数

分类专栏： java类文章标签： java tree list null iterator import

本文链接：https://blog.csdn.net/caipc2005/article/details/2720288

版权

java类专栏收录该内容

5 篇文章 0 订阅

订阅专栏

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Stack;

import javax.swing.tree.DefaultMutableTreeNode;

import com.model.tree.TreeNode;

public class TestList {
public static void main(String[] args) {
// TODO Auto-generated method stub

  List<TreeNode> list = new ArrayList<TreeNode>();
  TreeNode n = new TreeNode();
  n.setNodeid("01");
  n.setSuperid("0");
  list.add(n);

  n = new TreeNode();
  n.setNodeid("02");
  n.setSuperid("0");
  list.add(n);

  n = new TreeNode();
  n.setNodeid("0101");
  n.setSuperid("01");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("0102");
  n.setSuperid("01");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("0103");
  n.setSuperid("01");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("0201");
  n.setSuperid("02");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("0202");
  n.setSuperid("02");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("020201");
  n.setSuperid("0202");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("010101");
  n.setSuperid("0101");
  list.add(n);
  n = new TreeNode();
  n.setNodeid("01010101");
  n.setSuperid("010101");
  list.add(n);

  Collections.sort(list);

DefaultMutableTreeNode tree = createTree(list);

showTree(tree);
}

public static void showTree(DefaultMutableTreeNode tree){
  if(tree!=null){
   Stack<javax.swing.tree.TreeNode> stack=new Stack<javax.swing.tree.TreeNode>();
   javax.swing.tree.TreeNode t=null;
   stack.push(tree);
   while(!stack.empty()){
    javax.swing.tree.TreeNode tpop=stack.pop();
    System.out.println(tpop);
    int count=tpop.getChildCount();
    if(count>0){
     for(int i=0;i<count;i++){
      stack.push(tpop.getChildAt(i));
     }
    }
   }
  }
}

public static final DefaultMutableTreeNode createTree(List<TreeNode> list) {
  DefaultMutableTreeNode tree = new DefaultMutableTreeNode("root");
  Map<String, DefaultMutableTreeNode> map = getTreeNodeMap(list);
  while (list.size() > 0) {
   TreeNode n = (TreeNode) list.get(list.size() - 1);
   if (map.get(n.getSuperid()) == null) {
    tree.add(map.get(n.getNodeid()));
    map.remove(n.getNodeid());
    list.remove(n);
   } else {
    DefaultMutableTreeNode treeNode = map.get(n.getSuperid());
    treeNode.add(map.get(n.getNodeid()));
    map.remove(n.getNodeid());
    list.remove(n);
   }
  }
  return tree;
}

public static final Map<String, DefaultMutableTreeNode> getTreeNodeMap(
   List<TreeNode> nodes) {
  Map<String, DefaultMutableTreeNode> treeNodeMap = new HashMap<String, DefaultMutableTreeNode>();
  if (nodes == null) {
   return null;
  }
  Iterator I = nodes.iterator();
  while (I.hasNext()) {
   TreeNode n = (TreeNode) I.next();
   treeNodeMap.put(n.getNodeid(), new DefaultMutableTreeNode(n
     .getNodeid()));
  }
  treeNodeMap.put("root", new DefaultMutableTreeNode("root"));
  return treeNodeMap;
}