小编Dha*_*nan的帖子

尾部遍历在Java Hashmap中意味着什么？Java反转具有多个元素的(链表)存储桶.进行反转是为了避免Tail Traversing并向头部添加元素.我无法理解这个概念.

我有这样的结构

struct binTree{
long long data;
struct binTree *left;
struct binTree *right;
}

和这样的功能:

void height(struct binTree **r)
{
    ...
    ...
    height(&(r->left));
    height(&(r->right));
    ...
    ...
}

编译上面的函数给我这样的错误......

error: request for member ‘left’ in ‘* r’, which is of non-class type ‘binTree*’
error: request for member ‘right’ in ‘* r’, which is of non-class type ‘binTree*’

代码有什么问题？如何传递结构中的指针？