|
|
cf753f8ac4
|
Implement simple print method for single node element
|
2013-07-12 21:16:33 +02:00 |
|
|
|
6c14c68d93
|
prepares implementation of flat print method
|
2013-07-12 21:09:23 +02:00 |
|
|
|
ac878019fd
|
is_search_tree implemented
|
2013-07-11 23:24:37 +02:00 |
|
|
|
0d7bd76b2a
|
First is_search_tree attempt. Valid case seems to pass. Let s try the negation
|
2013-07-11 23:20:59 +02:00 |
|
|
|
81edb330eb
|
Adds is_search_node that checks whether a node is possibly part of a binary search tree
|
2013-07-09 19:48:16 +02:00 |
|
|
|
a511bb1687
|
Implement min, that find the lowest node value of a tree
|
2013-07-08 17:24:47 +02:00 |
|
|
|
1b7f6206f3
|
Implement max, that finx the highest node value of a tree
|
2013-07-08 17:20:38 +02:00 |
|
|
|
79980f3ad9
|
some small changes
|
2013-07-08 17:06:52 +02:00 |
|
|
|
3f7d84c896
|
Add method added. Also adds convenience method has_child in node class
|
2013-07-08 17:05:14 +02:00 |
|
|
|
a6264998bc
|
First test passes
|
2013-07-07 11:27:40 +02:00 |
|
|
|
6cf5ce85d8
|
Prepares binary search tree data structure.
|
2013-07-07 11:22:18 +02:00 |
|
Julien Lengrand-Lambert
|
40f77e4ea5
|
Seems to have a working version
|
2013-06-28 18:40:19 +02:00 |
|
Julien Lengrand-Lambert
|
0f12f99d1a
|
First version with odd length works. Try more now
|
2013-06-28 18:36:30 +02:00 |
|
Julien Lengrand-Lambert
|
7166bb43d0
|
Length 1 case handled
|
2013-06-28 18:09:52 +02:00 |
|
Julien Lengrand-Lambert
|
a9a97b64b7
|
Test inputs
|
2013-06-28 17:51:41 +02:00 |
|
Julien Lengrand-Lambert
|
02a0fe1273
|
First dumb unti test.
We're good to start
|
2013-06-28 17:44:38 +02:00 |
|
Julien Lengrand-Lambert
|
53cb6af0d2
|
Starts implementing binary search algorithm
|
2013-06-28 17:40:54 +02:00 |
|
