Tree: ac93db101b

0.1.7

master

next

release0.1.5

release0.1.6

release0.1.7

v0.1.8

v0.1.9

0.1.8

0.1.9

v0.1

v0.1.1

v0.1.2

v0.1.3

v0.1.4

v0.1.5

v0.1.6

v0.1.7

Branches Tags

${ item.name }

Create tag ${ searchTerm }

Create branch ${ searchTerm }

from 'ac93db101b'

${ noResults }

Commit Graph

7 Commits (ac93db101bb3988db7988f0d4be038d2a76ed423)

Author	SHA1	Message	Date
Georg Hopp	ac93db101b	fix traversal	12 years ago
Georg Hopp	1f40d1bc4b	alternative approach on delete of single child nodes. This one really exchanges the nodes, thus preventing large copy on big data that might be in the tree...anyway, for small data i think the other approach is faster.	12 years ago
Georg Hopp	e5fa68bf02	now use the parent in element in delete	12 years ago
Georg Hopp	847b275c86	fix insert and make another in-order traverse for checking	12 years ago
Georg Hopp	84451e7de3	remove wrong comment	12 years ago
Georg Hopp	74a60c72c1	add parent in element and implement an iterative in-order traversal with it.	12 years ago
Georg Hopp	3da465a846	add first own binary tree testcode. Not ballanced right now.	12 years ago