eddy/eddys_snippets
1
0
Fork 0
mirror of https://github.com/eddyem/eddys_snippets.git synced 2026-03-20 08:41:02 +03:00
Code Issues Packages Projects Releases Wiki Activity

first commit

Browse Source
This commit is contained in:
Eddy
2014-10-10 17:36:02 +04:00
commit 1a63497f04
62 changed files with 9055 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
B-trees.h Normal file
View File

@@ -0,0 +1,41 @@
/*
* B-trees.h
*
* Copyright 2013 Edward V. Emelianoff <eddy@sao.ru>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*/
#pragma once
#ifndef __B_TREES_H__
#define __B_TREES_H__
typedef struct btree_node{
int data;
struct btree_node *left, *right;
} BTree;
BTree *bt_get(BTree *root, int v);
BTree *bt_search(BTree *root, int v, BTree **prev);
BTree *bt_create_leaf(int v);
BTree *bt_insert(BTree **root, int v);
BTree *max_leaf(BTree *root, BTree **prev);
BTree *min_leaf(BTree *root, BTree **prev);
void bt_remove(BTree **root, int v);
void print_tree(BTree *leaf);
#endif // __B_TREES_H__