FilesExpand file tree

 main

/

set.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

118 lines (80 loc) · 2.02 KB

 main

/

set.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

118 lines (80 loc) · 2.02 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

//

// set.cpp

// set

//

// Created by Margulan Daribayev on 7/8/20.

// Copyright © 2020 Margulan Daribayev. All rights reserved.

//

#include "set.h"

#include <iostream>

set::treenode* set::copynodes(treenode *original) {

if(original == nullptr) {

return nullptr;

}

treenode *copiedTree = new treenode(original->value);

copiedTree->left = copynodes(original->left);

copiedTree->right = copynodes(original->right);

return copiedTree;

}

void set::deallocatenodes(set::treenode *node) {

if(node != nullptr) {

deallocatenodes(node->left);

deallocatenodes(node->right);

delete node;

}

}

bool set::containshelper(int i, set::treenode *node) {

if (node == nullptr)

return false;

// i found

else if (node->value == i)

return true;

// Recursively search for i

else if (i < node->value)

return (containshelper(i, node->left));

else

return (containshelper(i, node->right));

}

bool set::contains(int i) const {

return containshelper(i, root);

}

bool set::insert(int i) {

treenode *temp;

treenode *parent = nullptr;

if(root == nullptr) {

root = new treenode(i);

temp = root;

} else {

temp = root;

while(temp != nullptr) {

if(i == temp->value)

return false;

else if(i < temp->value) {

parent = temp;

temp = temp->left;

}

else {

parent = temp;

temp = temp->right;

}

}

treenode *toBeInserted = new treenode(i);

if(i < parent->value)

parent->left = toBeInserted;

else

parent->right = toBeInserted;

}

set_size++;

return true;

}

void set::clear() {

set_size = 0;

deallocatenodes(root);

root = nullptr;

}

size_t set::size() const {

return set_size;

}

bool set::empty() const {

return (set_size == 0);

}