Not Using/algorithm 썸네일형 리스트형 알고리즘 --- #include "binarytree.h" void BinaryTree::print(Node_Ptr x){ if(x!=NULL){ print(x->left); coutkey) return treeSearch(t->left, x); treeSearch(t->right, x); } Node_Ptr BinaryTree::treeInsert(Node_Ptr t, int x){ Node_Ptr r; r=(Node_Ptr)new Node; if(t==NULL){ r->key=x; r->left=NULL; r->right=NULL; return r; } if(xkey) {t->left=treeInsert((t->left),x); return t;} else {t->right=treeInsert((t->right),x.. 더보기 이전 1 2 다음