FilesExpand file tree

 master

/

TreeTest.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

100 lines (85 loc) · 1.44 KB

 master

/

TreeTest.java

Copy path

Top

File metadata and controls

• Code
• Blame

100 lines (85 loc) · 1.44 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

public class TreeTest extends Tree{

private node root;

private int nItem;

public int getItem()

{

return nItem;

}

TreeTest()

{

nItem = 0;

}

public boolean insert(int keydata)

{

node newNode = new node(keydata);

node current;

node parent;

if(root == null)

{

root = newNode;

}

else{

boolean isLeft = true;

current = root;

parent = current;

while(current != null)

{

parent = current;

if(keydata > current.data)

{

isLeft=false;

current = current.rightchild;

}

else

{

isLeft = true;

current = current.leftchild;

}

}

if(isLeft)

parent.leftchild = newNode;

else

parent.rightchild = newNode;

}

nItem++;

return true;

}

public int find(int key)

{

node current = root;

while (current != null)

{

if(key == current.data)

{

System.out.print("found the key!!");

return key;

}

else if (key< current.data)

{

current = current.leftchild;

}

else

{

current = current.rightchild;

}

}

System.out.println("No records exsist!!!!");

return -1;

}

public boolean traverse()

{

inorder(root);

return false;

}

private void inorder(node centnode)

{

if(centnode == null)

return;

else

{

inorder(centnode.leftchild);

System.out.print (" "+centnode.data+" ");

inorder(centnode.rightchild);

}

}

}