FilesExpand file tree

 master

/

Node.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

111 lines (91 loc) · 1.94 KB

 master

/

Node.java

Copy path

Top

File metadata and controls

• Code
• Blame

111 lines (91 loc) · 1.94 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package node;

import java.util.Iterator;

public class Node {

private Node left;

private Node top;

private Node right;

private Node bottom;

private String data;

public Node(String data) {

this.data = data;

}

public void addLeft(Node node){

if(left==null){

left=node;

}else {

left.addLeft(node);

}

}

public void addRight(Node node){

if(right==null){

right=node;

}else {

right.addRight(node);

}

}

public void addTop(Node node){

if(top==null){

top=node;

}else {

top.addTop(node);

}

}

public void addBottom(Node node){

if(bottom==null){

bottom=node;

}else {

bottom.addBottom(node);

}

}

public String getData() {

return data;

}

public void setData(String data) {

this.data = data;

}

public Node getLeft() {

return left;

}

public Node getTop() {

return top;

}

public Node getRight() {

return right;

}

public Node getBottom() {

return bottom;

}

public void print(){

System.out.println("Node{"+data+"}");

if(left!=null){

left.print();

}

if(top!=null){

top.print();

}

if(right!=null){

right.print();

}

if(bottom!=null){

bottom.print();

}

// System.out.println("Node{"+left.data+","+top.data+","+right.data+","+bottom.data+"}");

}

@Override

public String toString() {

return data;

}

public Node next() {

Node node;

if(right!=null){

node= right;

}else if(bottom!=null){

node= bottom;

}else if(left!=null){

node= left;

}else{

node= top;

}

return node;

}

}