mm823od/pvjc24
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

123

Browse Source
This commit is contained in:
Macko 2024-04-18 15:35:37 +02:00
parent 7448b7335b
commit 98c75026b8
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
a3/binary_search_tree.c
View File

@ -1,16 +1,16 @@
#include "binary_search_tree.h" #include "binary_search_tree.h"
#include <stdlib.h> #include <stdlib.h>
// Deklarace proměnné sorted_index // Deklaracia sorted_index
static int sorted_index; static int sorted_index;
// Deklarace funkce insert // Deklaracia funkcie insert
node_t* insert(node_t *node, int data); node_t* insert(node_t *node, int data);
// Deklarace funkce inorder_traversal // Deklaracia funkcie inorder_traversal
void inorder_traversal(node_t *node, int *sorted); void inorder_traversal(node_t *node, int *sorted);
// Definice funkce insert // Definicia funkcie insert
node_t* insert(node_t *node, int data) { node_t* insert(node_t *node, int data) {
if (node == NULL) { if (node == NULL) {
node_t *new_node = (node_t*)malloc(sizeof(node_t)); node_t *new_node = (node_t*)malloc(sizeof(node_t));
@ -26,7 +26,7 @@ node_t* insert(node_t *node, int data) {
} }
} }
// Definice funkce inorder_traversal // Definicia funkcie inorder_traversal
void inorder_traversal(node_t *node, int *sorted) { void inorder_traversal(node_t *node, int *sorted) {
if (node == NULL) return; if (node == NULL) return;
inorder_traversal(node->left, sorted); inorder_traversal(node->left, sorted);
@ -34,7 +34,7 @@ void inorder_traversal(node_t *node, int *sorted) {
inorder_traversal(node->right, sorted); inorder_traversal(node->right, sorted);
} }
// Deklarace funkce build_tree // Deklaracia funkcie build_tree
node_t* build_tree(int *tree_data, size_t tree_data_len) { node_t* build_tree(int *tree_data, size_t tree_data_len) {
node_t *root = NULL; node_t *root = NULL;
for (size_t i = 0; i < tree_data_len; i++) { for (size_t i = 0; i < tree_data_len; i++) {
@ -43,7 +43,7 @@ node_t* build_tree(int *tree_data, size_t tree_data_len) {
return root; return root;
} }
// Deklarace funkce free_tree // Deklaracia funkcie free_tree
void free_tree(node_t *tree) { void free_tree(node_t *tree) {
if (tree == NULL) return; if (tree == NULL) return;
free_tree(tree->left); free_tree(tree->left);
@ -51,9 +51,9 @@ void free_tree(node_t *tree) {
free(tree); free(tree);
} }
// Deklarace funkce sorted_data // Deklaracia funkcie sorted_data
int *sorted_data(node_t *tree) { int *sorted_data(node_t *tree) {
int *sorted = (int*)malloc(sizeof(int) * 1000); // Předpokládáme, že strom má maximálně 1000 prvků int *sorted = (int*)malloc(sizeof(int) * 1000);
sorted_index = 0; sorted_index = 0;
inorder_traversal(tree, sorted); inorder_traversal(tree, sorted);
return sorted; return sorted;