Lines Matching refs:node
26 private Node root;
29 * Add {@code value} to all middle and end {@link Node#values} that correspond to {@code key}.
32 * "O". But if the traversal required visiting {@link Node#left} or {@link Node#right}, {@code
42 private Node put(Node node, String key, int value, int position) {
44 if (node == null) {
45 node = new Node();
46 node.key = c;
48 if (c < node.key) {
49 node.left = put(node.left, key, value, position);
50 } else if (c > node.key) {
51 node.right = put(node.right, key, value, position);
53 node.values.add(value);
54 node.mid = put(node.mid, key, value, position + 1);
56 node.values.add(value);
58 return node;
66 /** Return value stored at Node (in this case, a set of integers). */
68 Node x = get(root, key, 0);
72 private Node get(Node node, String key, int position) {
73 if (node == null) {
77 if (c < node.key) {
78 return get(node.left, key, position);
79 } else if (c > node.key) {
80 return get(node.right, key, position);
82 return get(node.mid, key, position + 1);
84 return node;
88 /** Node in ternary search trie. Children are denoted as left, middle and right nodes. */
89 private static class Node {
93 private Node left;
94 private Node mid;
95 private Node right;
