src/taesooLib/BaseLib/motion/IK_sdls/Tree.cpp
Node* Tree::SearchJoint(Node* node, int index)
{
	Node* ret;
	if (node != 0) {
		if (node->seqNumJoint == index) {
			return node;
		} else {
			if (ret = SearchJoint(node->left, index)) {
				return ret;
			}
			if (ret = SearchJoint(node->right, index)) {
				return ret;
			}
			return NULL;
		}
	} 
	else {
		return NULL;
	}
}
// Search recursively below "node" for the node with index value.
Search recursively below "node" for the node with index value.
Search recursively below " node " for the node with index value .
Node* Tree::SearchJoint(Node* node, int index)
{
	Node* ret;
	if (node != 0) {
		if (node->seqNumJoint == index) {
			return node;
		} else {
			if (ret = SearchJoint(node->left, index)) {
				return ret;
			}
			if (ret = SearchJoint(node->right, index)) {
				return ret;
			}
			return NULL;
		}
	} 
	else {
		return NULL;
	}
}
Node * Tree :: SearchJoint ( Node * node , int index ) { Node * ret ; if ( node != 0 ) { if ( node -> seqNumJoint == index ) { return node ; } else { if ( ret = SearchJoint ( node -> left , index ) ) { return ret ; } if ( ret = SearchJoint ( node -> right , index ) ) { return ret ; } return NULL ; } } else { return NULL ; } }
Search recursively below "node" for the node with index value.
Search recursively below " node " for the node with index value .