FilesExpand file tree

 master

/

FindHeightOfTree.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

100 lines (89 loc) · 2.4 KB

 master

/

FindHeightOfTree.java

Copy path

Top

File metadata and controls

• Code
• Blame

100 lines (89 loc) · 2.4 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

/**

*

* @author Varun Upadhyay (https://github.com/varunu28)

*

*/

import java.util.LinkedList;

public class FindHeightOfTree {

// Driver Program

public static void main(String[] args) {

Node tree = new Node(5);

tree.insert(3);

tree.insert(7);

tree.insert(1);

tree.insert(-1);

tree.insert(29);

tree.insert(93);

tree.insert(6);

tree.insert(0);

tree.insert(-5);

tree.insert(-6);

tree.insert(-8);

tree.insert(-1);

// A level order representation of the tree

tree.printLevelOrder();

System.out.println();

System.out.println("Height of the tree is: " + tree.findHeight());

}

}

/**

* The Node class which initializes a Node of a tree

* printLevelOrder: ROOT -> ROOT's CHILDREN -> ROOT's CHILDREN's CHILDREN -> etc

* findHeight: Returns the height of the tree i.e. the number of links between root and farthest leaf

*/

class Node {

Node left, right;

int data;

public Node(int data) {

this.data = data;

}

public void insert (int value) {

if (value < data) {

if (left == null) {

left = new Node(value);

}

else {

left.insert(value);

}

}

else {

if (right == null) {

right = new Node(value);

}

else {

right.insert(value);

}

}

}

public void printLevelOrder() {

LinkedList<Node> queue = new LinkedList<>();

queue.add(this);

while(!queue.isEmpty()) {

Node n = queue.poll();

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

if (n.left != null) {

queue.add(n.left);

}

if (n.right != null) {

queue.add(n.right);

}

}

}

public int findHeight() {

return findHeight(this);

}

private int findHeight(Node root) {

if (root.left == null && root.right == null) {

return 0;

}

else if (root.left != null && root.right != null) {

return 1 + Math.max(findHeight(root.left), findHeight(root.right));

}

else if (root.left == null && root.right != null) {

return 1 + findHeight(root.right);

}

else {

return 1 + findHeight(root.left);

}

}

}