1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
//===-- main.cpp ------------------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
struct node;
struct node {
int value;
node* next;
node () : value(1),next(NULL) {}
node (int v) : value(v), next(NULL) {}
};
void make_tree(node* root, int count)
{
int countdown=1;
if (!root)
return;
root->value = countdown;
while (count > 0)
{
root->next = new node(++countdown);
root = root->next;
count--;
}
}
int main (int argc, const char * argv[])
{
node root(1);
make_tree(&root,25000);
return 0; // Set break point at this line.
}
|
