二叉排序树根据问题和代码用C++实现编写递归算法，从大到小输出关键字不小于x的数据元素。 void PrintNLT(BinarySortTree tree, BTNode* root, int data) { }-Go服务器开发

下面是一个使用C++编写的递归算法，从大到小输出二叉排序树中不小于给定值x的关键字数据元素：

#include <iostream>
using namespace std;
template<typename T>
struct BTNode {
    T data;
    BTNode<T>* left;
    BTNode<T>* right;
};
template<typename T>
class BinarySortTree {
public:
    BinarySortTree() {
        root = nullptr;
    }
    void Insert(T data) {
        InsertHelper(root, data);
    }
private:
    BTNode<T>* root;
    void InsertHelper(BTNode<T>*& node, T data) {
        if (node == nullptr) {
            node = new BTNode<T>;
            node->data = data;
            node->left = nullptr;
            node->right = nullptr;
        }
        else if (data < node->data) {
            InsertHelper(node->left, data);
        }
        else if (data > node->data) {
            InsertHelper(node->right, data);
        }
    }
public:
    void PrintNLT(int x) {
        PrintNLTHelper(root, x);
    }
private:
   void PrintNLTHelper(BTNode<int>* node, int x) {
       if (node == nullptr)
           return;
       // 先遍历右子树
       PrintNLTHelper(node->right, x);
       // 输出不小于x的节点值
       if (node->data >= x)
           cout << node->data << " ";
       // 遍历左子树
       PrintNLTHelper(node->left, x);
   }
};
int main() {
    BinarySortTree<int> tree;
    
    // 构建二叉排序树
    tree.Insert(6);
    tree.Insert(4);
    tree.Insert(8);
    tree.Insert(2);
    tree.Insert(5);
    tree.Insert(7);
    tree.Insert(9);
    // 从大到小输出不小于x的数据元素
    int x = 5;
    cout << "从大到小输出不小于" << x << "的数据元素：";
    tree.PrintNLT(x);
    return 0;
}