Пример #1
0
  private void add(NodeValue value) {
    Node r_node = new Node(last_node.getKey());

    nodes.remove(r_node.getKey());
    nodes.put(r_node.getKey().getType(), r_node);

    last_node.setLeftChild(r_node);
    last_node.setKey(new NodeValue(AND));
    Node new_node = new Node(value);

    nodes.put(new_node.getKey().getType(), new_node);

    last_node.setRightChild(new_node);
    last_node = new_node;
  }
Пример #2
0
 public Tree(String searchString) {
   NodeValue value = new NodeValue(FILE_NAME);
   value.setValue(DATA_KEY, searchString);
   root = new Node(value);
   last_node = root;
   nodes.put(root.getKey().getType(), root);
 }
Пример #3
0
  private List<NodeValue> traverse(Node node) {
    if (node == null) return null;
    List<NodeValue> list = new LinkedList<NodeValue>();
    List<NodeValue> result;

    list.add(node.getKey());
    result = traverse(node.getLeftChild());
    if (result != null) {
      list.addAll(result);
      result.clear();
    }

    result = traverse(node.getRightChild());
    if (result != null) list.addAll(result);

    return list;
  }