FilesExpand file tree

 master

/

BinarySearchTree.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

102 lines (76 loc) · 2.15 KB

 master

/

BinarySearchTree.java

Copy path

Top

File metadata and controls

• Code
• Blame

102 lines (76 loc) · 2.15 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

import java.util.Scanner;

public class BinarySearchTree {

/* Class containing left and right child of current node and key value*/

class Node {

int key;

Node left, right;

public Node(int item) {

key = item;

left = right = null;

}

}

// Root of BST

Node root;

// Constructor

BinarySearchTree() {

root = null;

}

// This method mainly calls insertRec()

void insert(int key) {

root = insertRec(root, key);

}

/* A recursive function to insert a new key in BST */

Node insertRec(Node root, int key) {

/* If the tree is empty, return a new node */

if (root == null) {

root = new Node(key);

return root;

}

/* Otherwise, recur down the tree */

if (key < root.key)

root.left = insertRec(root.left, key);

else if (key > root.key)

root.right = insertRec(root.right, key);

/* return the (unchanged) node pointer */

return root;

}

// This method mainly calls InorderRec()

void inorder() {

inorderRec(root);

}

// A utility function to do inorder traversal of BST

void inorderRec(Node root) {

if (root != null) {

inorderRec(root.left);

System.out.print(root.key+"\t");

inorderRec(root.right);

}

}

public static void main(String[] args) {

BinarySearchTree tree = new BinarySearchTree();

Scanner scan = new Scanner(System.in);

int i=1,key;

do

{

System.out.println("Enter your choice");

System.out.println("1.insert\n2.inorder\n3.exit");

i=scan.nextInt();

switch(i)

{

case 1:

key = scan.nextInt();

tree.insert(key);

break;

case 2:

tree.inorder();

System.out.println();

break;

case 3:

break;

default:

System.out.println("enter a valid number");

}

}while(i!=3);

tree.inorder();

}

}