이진탐색트리 구현 프로그램 cpp

1. 소스코드

Node root; void insert(Node& node, int value) {if (node nullptr) {node = new Node(value);} else if (value ` node-`data) {insert(node-`left, value);} else {insert(node-`right, value);}} bool search(Node node, int value) {if (node nullptr) {return false;} else if (node-`data value) {return true;} else if (value ` node-`data) {return search(node-`left, value);} else {return search(node-`right, value);}} void inorder(Node node) {if (node != nullptr) {inorder(node-`left);stdcout `` node-`data `` ` `;inorder(node-`right);}} void destroyTree(Node node) {if (node != nullptr) {destroyTree(node-`left);destroyTree(node-`right);delete node;}} publicBinarySearchTree{root = nullptr;} ~BinarySearchTree{destroyTree(root);} void insert(int value) {insert(root, value);} bool search(int value) {return search(root, value);} void inorder{inorder(root);stdcout `` stdendl;}}; int main{BinarySearchTree bst;bst. insert(10);bst. insert(;bst. insert(1;bst. insert(;bst. insert(;bst. insert(1;bst…