FilesExpand file tree

 master

/

Main.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

119 lines (87 loc) · 3.03 KB

 master

/

Main.java

Top

File metadata and controls

• Code
• Blame

119 lines (87 loc) · 3.03 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

112

113

114

115

116

117

118

119

public class Main{

public static void main(String[] args){

//System.out.println("I am Java");

// System.out.println("khud ki linked list bana rahe h.");

// SLL sll = new SLL();

// sll.addFirst(1);

// sll.addFirst(2);

// sll.addFirst(3);

// sll.addFirst(4);

// sll.addFirst(5);

//

// sll.display();

// int[] arr = {18, 12, 9 , 14, 77, 50};

//

// Search search = new Search();

// int index = search.SearchItem(arr,14);

//

// System.out.println(index);

// int[] arr = {-9999, -10, 15, 15 , 55, 8888};

//

// BinarySearch search = new BinarySearch();

// int index = search.search(arr, -10);

// int[] arr = {-1,0,3,5,9,12};

//

// BinarySearch search = new BinarySearch();

// int index = search.SearchInsertPosition(arr, 4);

// System.out.println(index);

// int[] arr = {2, 3, 5, 9, 14, 16, 18};

//

// Ceiling c = new Ceiling();

// int index = c.search(arr, 0);

// int[] arr = {1, 2, 8, 10, 10, 12, 19};

//

// SearchFloor c = new SearchFloor();

// int index = c.search(arr, 2);

//char[] arr = {'a','b','c','e','f','x','y','z'};

// BinarySearchChar search = new BinarySearchChar();

// int index = search.search(arr, 'k');

// char[] arr = {'a','b','c','e','f','x','y','z'};

// BinarySearchChar search = new BinarySearchChar();

// int index = search.smallestLetter(arr, 'k');

// int[] arr = {1, 3, 15, 15 , 15, 55, 8888};

//

// SearchRange search = new SearchRange();

// search.search(arr, 15);

// int[] arr = {1, 3, 15, 14 , 11, 3, 1};

//

// MountainPeak search = new MountainPeak();

// int result = search.FindPeakIndex(arr);

// System.out.println("peak = " + result);

// int[] arr = {0,3,4,2,6,1};

//

// MissingNumber obj = new MissingNumber();

// int response = obj.missingNumber(arr);

// System.out.println(response);

// int[] arr = {1,3,4,2,2};

//

// FindDuplicateNumber obj = new FindDuplicateNumber();

// int response = obj.findDuplicate(arr);

// System.out.println(response);

// LLAddTwoNumbers obj = new LLAddTwoNumbers();

// //obj.fun1();

// obj.fun2();

// LLremoveNthFromEnd obj = new LLremoveNthFromEnd();

// obj.fun1();

//LLMergeTwoSortedLists obj = new LLMergeTwoSortedLists();

//obj.fun1();

// RecursionFind obj = new RecursionFind();

// obj.FindList();

// Utility obj = new Utility();

// //obj.fun1();

// obj.fun2();

// Tree tree = new Tree();

// tree.BFS();

TreeNode a = new TreeNode("a");

TreeNode b = new TreeNode("b");

TreeNode c = new TreeNode("c");

TreeNode d = new TreeNode("d");

TreeNode e = new TreeNode("e");

TreeNode f = new TreeNode("f");

a.left = b;

a.right = c;

b.left = d;

b.right = e;

c.left = f;

}

}