parent 두 갈래 나무의 단서가 두루 다니다 * _parent; PointerTag _leftTag; PointerTag _rightTag; BinaryTreeNodeThd(const T& x) :_data(x) ,_left(NULL) ,_right(NULL) ,_parent(NULL) ,_leftTag(LINK) ,_rightTag(LINK) {} }; template class BinaryTreeThd { public: Binary... includepublicparent
두 갈래 나무의 단서가 두루 다니다 * _parent; PointerTag _leftTag; PointerTag _rightTag; BinaryTreeNodeThd(const T& x) :_data(x) ,_left(NULL) ,_right(NULL) ,_parent(NULL) ,_leftTag(LINK) ,_rightTag(LINK) {} }; template class BinaryTreeThd { public: Binary... includepublicparent