Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- private Integer next(int key) {
- Node n = root;
- int val = key;
- while (n != null) {
- if (n.key <= key) {
- n = n.right;
- } else {
- val = n.key;
- n = n.left;
- }
- }
- return val == key ? null : val;
- }
- private Integer prev(int key) {
- Node n = root;
- int val = key;
- while (n != null) {
- if (n.key >= key) {
- n = n.left;
- } else {
- val = n.key;
- n = n.right;
- }
- }
- return val == key ? null : val;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement