fdd9bb1af6
- check for isTied() and refcount has to be made *before* we go into recursion, so as to pertain subtrees of refcounted nodes, even if there are no refcounted/tied nodes *in* this tree - return value inverted, because it's more logical to say removeChildren() == true --> everything removed; false --> failed - further cleanup
[ Nothing here at this time. ]