SearchTree/InternalNode.java at master · ivenree/SearchTree · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

// -------------------------------------------------------------------------
/**
 *  Internal Node calss.
 *
 *  @author wenfeng ren(rwenfeng)
 *  @version Oct 4, 2014
 */
public class InternalNode extends Node
{

    private Node lNode;
    private Node mNode;
    private Node rNode;
    private KVPair lPair;
    private KVPair rPair;

    // ----------------------------------------------------------
    /**
     * Create a new InternaLnode object.
     */
    public InternalNode()
    {
        lNode = null;
        mNode = null;
        rNode = null;
        lPair = null;
        rPair = null;
    }

    // ----------------------------------------------------------
    /**
     * get left pair.
     * @return Left pair
     */
    public KVPair getLPair()
    {
        return lPair;
    }

    // ----------------------------------------------------------
    /**
     * set left pair.
     * @param lpair to be set
     */
    public void setLPair(KVPair lpair)
    {
        this.lPair = lpair;
    }

    // ----------------------------------------------------------
    /**
     * get right pair.
     * @return Right pair
     */
    public KVPair getRPair()
    {
        return rPair;
    }

    // ----------------------------------------------------------
    /**
     * set right pair.
     * @param rpair to be set
     */
    public void setRPair(KVPair rpair)
    {
        this.rPair = rpair;
    }

    // ----------------------------------------------------------
    /**
     * get left node.
     * @return Left node
     */
    public Node getLNode()
    {
        return lNode;
    }

    // ----------------------------------------------------------
    /**
     * set left node.
     * @param lnode to be set
     */
    public void setLNode(Node lnode)
    {
        this.lNode = lnode;
    }

    // ----------------------------------------------------------
    /**
     * get middle node.
     * @return Middle Node
     */
    public Node getMNode()
    {
        return mNode;
    }

    // ----------------------------------------------------------
    /**
     * set middle node.
     * @param mnode to be set
     */
    public void setMNode(Node mnode)
    {
        this.mNode = mnode;
    }

    // ----------------------------------------------------------
    /**
     * get the right node.
     * @return Right node
     */
    public Node getRNode()
    {
        return rNode;
    }

    // ----------------------------------------------------------
    /**
     * set right node.
     * @param rnode to be set
     */
    public void setRNode(Node rnode)
    {
        this.rNode = rnode;
    }

}