FilesExpand file tree

 master

/

reverse_binaryTree.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

77 lines (66 loc) · 1.55 KB

 master

/

reverse_binaryTree.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

77 lines (66 loc) · 1.55 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

// binary tree

struct treeNode {

int val;

treeNode* left;

treeNode* right;

treeNode(int x) : val(x), left(nullptr), right(nullptr) {}

};

// 0. create

treeNode* insertTree(treeNode* root, int value) {

if(root == nullptr) {

// cout << "11" << endl;

return new treeNode(value);

}

if(value < root->val) {

root->left = insertTree(root->left, value);

} else if(value > root->val) {

root->right = insertTree(root->right, value);

}

return root;

}

void insert2(treeNode** root, int val) {

if(*root == nullptr) {

*root = new treeNode(val);

}

if(val < (*root)->val) {

insert2(&((*root)->left), val);

} else if(val > (*root)->val) {

insert2(&((*root)->right), val);

}

}

// 1. travel

void travelTree(treeNode* root) {

if(root == nullptr) {

// cout << "empty" << endl;

return;

}

// cout << root->val << endl;

travelTree(root->left);

// cout << root->val << endl;

travelTree(root->right);

cout << root->val << endl;

}

// 2. reverse

treeNode* reverse(treeNode* root) {

if(root == nullptr) {

return root;

}

swap(root->left, root->right);

reverse(root->left);

reverse(root->right);

return root;

}

// 3. search - simple

bool search(treeNode* root, int val) {

if(root == nullptr) {

return false;

}

if(root->val == val) {

return true;

}

if(val < root->val)

search(root->left, val);

else

search(root->right, val);

return false;

}