GitHub - edomerz/rtree

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
Readme.txt		Readme.txt
Readme.txt~		Readme.txt~
RecBinTree.c~		RecBinTree.c~
RecBinTree.h~		RecBinTree.h~
RecBinTree_test.c~		RecBinTree_test.c~
maketext.txt		maketext.txt
rec_tree.graphml		rec_tree.graphml
rec_tree1.graphml		rec_tree1.graphml
rec_tree2.graphml		rec_tree2.graphml
rtree.c		rtree.c
rtree.c~		rtree.c~
rtree.h		rtree.h
rtree.h~		rtree.h~
rtree.o		rtree.o
rtree_test.c		rtree_test.c
rtree_test.c~		rtree_test.c~
rtree_test.o		rtree_test.o
rtree_test_omer.c		rtree_test_omer.c
rtree_test_v1.c		rtree_test_v1.c
rtree_test_v2.c		rtree_test_v2.c
rtree_test_v2.c~		rtree_test_v2.c~
rtree_test_v3.c		rtree_test_v3.c
rtree_test_v3.c~		rtree_test_v3.c~
rtree_v1.c		rtree_v1.c
rtree_v1.h		rtree_v1.h
rtree_v3.c		rtree_v3.c
rtree_v3.c.h		rtree_v3.c.h
rtree_v3.ch		rtree_v3.ch
rtree_v3.h		rtree_v3.h
rtree_v3.h~		rtree_v3.h~
rtree_v4.c		rtree_v4.c

Repository files navigation

RecBinTree

- no dupilcates
- no iterators, hence no parent field. working on the entire tree
- balanced tree, balance factor( height of left subtree minus height of right tree)
- 2 added functions , rotate left, rotate right

node:
right
left
data
balance factor

r_tree_node_t

Create
Destroy -> post order ( post refers to the parent node  2 3 1)
IsEmpty
Height
Size
Insert
Remove
Find
ForEach - does not touch the key -> in order 213































































































































































































































































































-  use height
- levels