* pCurrentNode = NULL; int i = 0; if ( pBTree != NULL) { pCurrentNode = pBTree - pRootNode ; // 루트노드로 시작 while ... ( pCurrentNode != NULL){ for ( i = 0; i pCurrentNode - elementCount ; i ++) { int parentKey ... = pCurrentNode - element[ i ].key; if (key == parentKey ) { pReturn = pCurrentNode - element[ i ]; return