二叉排序树递归插入结点,中序遍历结果是4,5,8。其他结点去哪儿了?麻烦给看看,谢谢! #include<iostream> using namespace std; struct BinaryTree { int val; BinaryTree* left; BinaryTree* right; BinaryTree(int n) :left(NULL), right(NULL), val(n) {} }; BinaryTree* BST_insert(BinaryTree* root, int value) { //我懵逼了!!! if (root == NULL...