我如何编码二叉树蒙特结构。 [英] How do I code binary tree whith structure.

问题描述

我想通过二叉树在数组中排序元素。我创建了函数insert（root，element_of_array）。在函数插入中它比较节点的值并决定左侧或右侧如果节点为NULL则添加新节点。



这些解决方案之间有什么区别？

I want sort elements in array by binary tree. I created function insert(root,element_of_array). In function insert it compare values of nodes and decide to go left or right side if node is NULL it add new node.

What is difference between these solutions ?

struct node{
    int value;
    struct node *r,*l;
};

  void insert(struct node *root,struct node *new_n){
       struct node *cr = root;
       //The first
       while(cr != NULL){
        if(cr->value > new_n->value){
            cr = cr->l;
        }else{
            cr = cr->r;
        }
       }
        cr = new_n;


        /*The second
        if(new_n->value < cr->value){
            if(cr->l == NULL)
                cr->l = new_n;
            else
                insert(cr->l,new_n);
        }
        if(new_n->value > cr->value){
            if(cr->r == NULL)
                cr->r = new_n;
            else
                insert(cr->r,new_n);
        }
        */

  }
  int main(){
          int i;
          struct node array[10];
          struct node *root=0;
          root = &array[0];
          srand(time(NULL));


          for(i=0;i<10;i++){
                  array[i].value = rand() % 100;
                  printf("prvok %d ma hodnotu :%d\n",i,array[i].value);
                  array[i].l = NULL;
                  array[i].r = NULL;
          }
          printf("++++++++++++++++++++++++++++++++++++++++++++++++\n");
          for(i=1;i<10;i++){
                  insert(root,&array[i]);
          }
          return 0;
  }

我的尝试：



我尝试过更改：

* cr = * new_n;

------------------ --------------

cr = malloc（sizeof（struct node））;

* cr = * new_n;

What I have tried:

I tried change:
*cr = *new_n;
--------------------------------
cr = malloc(sizeof(struct node));
*cr = *new_n;

推荐答案

Google是您的朋友：二叉树排序c [ ^ ]

Google is your friend: binary tree sort c[^]

引用：

这些解决方案有什么区别？

What is difference between these solutions ?

我只看到1段代码。



当你不理解你的代码在做什么或为什么它做它的作用时，答案是调试器。

使用调试器来查看代码在做什么。只需设置断点并查看代码执行情况，调试器允许您逐行执行第1行并在执行时检查变量，这是一个令人难以置信的学习工具。



调试器 - 维基百科，免费的百科全书 [ ^ ]

掌握Visual Studio 2010中的调试 - 初学者指南 [ ^ ]



调试器在这里显示你的代码正在做什么，你的任务是与它应该做什么进行比较。

调试器中没有魔法，它没有发现错误，它只是帮助你。当代码没有达到预期的效果时，你就会接近一个错误。

I see only 1 piece of code.

When you don't understand what your code is doing or why it does what it does, the answer is debugger.
Use the debugger to see what your code is doing. Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute, it is an incredible learning tool.

Debugger - Wikipedia, the free encyclopedia[^]
Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[^]

The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't find bugs, it just help you to. When the code don't do what is expected, you are close to a bug.

这篇关于我如何编码二叉树蒙特结构。的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！