|
|
eb2f371e05
|
Finishes testing the iterator implementation
|
2013-07-19 16:28:05 +02:00 |
|
|
|
bfcc796b3a
|
Rolls out first version of iterator for retrieving ordered values of binary search tree
|
2013-07-19 10:40:13 +02:00 |
|
|
|
25936d8413
|
implements print tree method
|
2013-07-15 16:31:07 +02:00 |
|
|
|
e731857f82
|
enhances print node to take care of more special cases
|
2013-07-12 21:21:20 +02:00 |
|
|
|
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 |
|
|
|
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 |
|
|
|
6cf5ce85d8
|
Prepares binary search tree data structure.
|
2013-07-07 11:22:18 +02:00 |
|
