数据结构c++实现二叉树

int main() { BinaryTree bt; bt.insert(1); bt.insert(2); bt.insert(3); std::cout << "Preorder traversal: "; bt.preorderTraversal(bt.root); std::cout << std::endl; std::cout << "Inorder traversal: "; bt.inorderTraversal(bt.root); std::cout << std::endl; std::cout << "Postorder traversal: "; bt.postorderTraversal(bt.root); std::cout << std::endl; TreeNode* found = bt.find(2); if (found != nullptr) { std::cout << "