FilesExpand file tree

 master

/

tree.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

83 lines (74 loc) · 1.38 KB

 master

/

tree.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

83 lines (74 loc) · 1.38 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

#include"tree.h"

tree alokasinode(int id){

tree a;

a = new node;

left(a) = NULL;

right(a) = NULL;

id(a) = id;

return a;

}

int nVertex(tree T){

if(T==NULL){

return 0;

}

else{

return 1 + nVertex(left(T)) + nVertex(right(T));

}

}

int nLeaves(tree T){

if(T==NULL){

return 0;

}

else if(left(T)==NULL && right(T)==NULL){

return 1;

}

else{

return nLeaves(left(T)) + nLeaves(right(T));

}

}

adrnode depthFirstSearch(tree T, int X){

if(T == NULL){

return NULL;

}

else{

if(id(T) == X){

return T;

}

else{

adrnode L = depthFirstSearch(left(T),X);

adrnode R = depthFirstSearch(right(T),X);

if(L != NULL){

return L;

}

else if(R != NULL){

return R;

}

else{

return NULL;

}

}

}

}

int height(tree T){

if (T != NULL){

int l;

int r;

l = 1 + height(left(T));

r = 1 + height(right(T));

if (l>r){

return l;

}else{

return r;

}

}

}

bool balanced(tree T){

if (T != NULL){

int l = height(left(T));

int r = height(right(T));

if(abs(l-r)<=1){

return 1;

}

return 0;

}

}