*** test program for CTree class
initial state:
count: 0
root:root node: nil
current:nil
list:
----
----
add first node:
count: 1
root:root node: (node 1)
current:(node 1)
list:
----
(node 1)
----
insert second node:
count: 2
root:root node: (node 2)
current:(node 1)
list:
----
(node 2)
(node 1)
----
append and prepend children:
count: 3
root:root node: (node 2)
current:(node 1)
list:
----
(node 2)
(node 1)
 (node 3)
----
count: 5
root:root node: (node 2)
current:(node 1)
list:
----
(node 2)
(node 1)
 (node 3)
 (node 4)
----
move to last child and move to parent:
can i return the same place?
count: 5
root:root node: (node 2)
current:(node 1)
list:
----
(node 2)
(node 1)
 (node 3)
 (node 4)
----
remove the current node:
releasing : 1
releasing : 3
releasing : 4
count: 1
root:root node: (node 2)
current:(node 2)
list:
----
(node 2)
----
end of the program:
releasing : 2
bye.
