Tree

 
ÄÄÇ»ÅÍ°úÇп¡¼­ Æ®¸®´Â ¸¹Àº °¡Áö (³ëµå, node) °¡ ¿¬°áµÈ ³ª¹«¸¦ Èä³»³½ ³Î¸® »ç¿ëµÇ´Â ÀڷᱸÁ¶ÀÌ´Ù. °¢ ³ëµå´Â ³ª¹«¿¡¼­ ¾Æ·¡¿¡ À§Ä¡ÇÏ´Â Àڽijëµå (child node)¸¦ °¡Áø´Ù (ÄÄÇ»ÅÍ°úÇп¡¼­´Â ÀÚ¿¬¿¡¼­¿Í ´Þ¸® ³ª¹«°¡ À§·Î ÀÚ¶óÁö ¾Ê°í ¾Æ·¡·Î ÀÚ¶õ´Ù). ÀÚ½ÄÀ» °¡Áö´Â ³ëµå¸¦ ºÎ¸ð³ëµå (parent node) ¶ó°í ºÎ¸¥´Ù. ÀÚ½ÄÀº ÇϳªÀÇ ºÎ¸ðµé °¡Áö¸ç, ºÎ¸ð°¡ ¾ø´Â ³ëµå¸¦ root node ¶ó°í ºÎ¸¥´Ù. ÀÚ½ÄÀÌ ¾ø´Â ³ëµå¸¦ leaf node ¶ó°í ºÎ¸¥´Ù. .....  ±×·¡ÇÁ ÀÌ·Ð (Graph Theory) ¿¡¼­ Æ®¸®´Â connected acyclic graph ÀÌ´Ù. Tree search algorithms Àº Æ®¸®ÀÇ ¼ºÁúÀ» °í·ÁÇÑ graph search algorithms ÀÇ Æ¯º°ÇÑ °æ¿ìÀÌ´Ù.

Æ®¸®ÀÇ Á¤ÀÇ : ÀüºÏ´ë ¹Ú¼øö ±³¼ö´Ô µ¿¿µ»ó

Term :

Ž»ö (Search)   ÀÇ»ç°áÁ¤ Æ®¸® (Decision Tree)

Site :

Wikipedia : Tree data structure

Paper :  

±×·¡ÇÁ¿Í Æ®¸® : Peter Linz 

Æ®¸®ÀÇ ¿ë¾î¿Í Ư¼º (Terminology and Characterizations of Trees)   ½ÅÀå Æ®¸® (Spanning Trees) : Richard Johnsonbaugh

±âÈ£³í¸®Çп¡¼­ÀÇ Æ®¸® : ¼Ò±¤Èñ