A problem with a binary tree

sonichxq

The program enters integers one by one. When the input integer is not the end flag -9999, it is inserted into the binary sorting tree. If the value node is found to exist in the binary sorting tree during the insertion process, the repeatability is counted The count of this node. Until the end of all input.

#include <stdio.h>
#include <stdlib.h>
typedef struct Binary
{
     int val, count;
     struct Binary * left * right;
} Binary;

void binaryTree (Binary ** t, int data)
{
    Binary * ptr, * p;
    int d;
    p = NULL;
    ptr = _______ (1) _______;
    while (_______ (2) _______)
    {
        if (data == ptr-> val)
           _______ (3) _______;
        else
        {
           p = ptr;
           ptr = _______ (4) _______;
     }

    ptr = (Binary *) malloc (sizeof (Binary));
    ptr-> right = ptr-> left = NULL;
    _______ (5) _______;
    if (_______ (6) _______)
       _______ (7) _______ = ptr;
    else if (data> p-> val)
         p-> right = ptr;
         else
         p-> left = ptr;
}
     
void main ()
{
   Binary * root = NULL;
   int d;
   scanf ("% d",&d);
   while (d! =-9999)
   {
      binaryTree (_______ (8) _______);
      scanf ("% d",&d);
    }
}

yashironan

My answer is (1) * t
          (2) ptr! = NULL
          (3) ptr-> count ++; return;
          (4)
          (5) ptr-> val = data;
          (6) * t == NULL
          (7) * t
          (8)&root, d

gwf17445

The source code is incorrect, and {? Is still the case. . . .

4 ptr-> right? Ptr-> left: data> ptr-> val} (perverted)
5 ptr-> val = data; ptr-> count = 1;

sonichxq

while (_______ (2) _______)
    {
        if (data == ptr-> val)
           _______ (3) _______;
        else
        {
           p = ptr;
           ptr = _______ (4) _______;
         }
     }
Change it. Missed one here)

sonichxq

gwf17445Thank you (4) for the answer.
But is it wrong? Because it is data <ptr-> val? Ptr-> right: ptr-> left

ddd223

Upstairs 4 seems to write a bit of syntax error:
4 data> ptr-> val? ptr-> right: ptr-> left;}

sonichxq

The other answers are correct

ddd223

gwf17445answer is good, like!

badapple

mark

sonichxq

Top. Brothers are really better than one. I'm too soiled