1. Tree ��본 ��념들
2. Binary Tree
3. Binray Tree ��
4. Binary Tree Traversal
5. Binary Search Trees (��리말�� 리)
6. Insert x
7. Delete x(�� 복��)
8. Tree�� 몇��(Cross Reference �� 변��. C++��는 ��-.-)

1. Tree ��본 ��념들 ¶

Node : 노��
Root : 맨 ��대�� 노��
Edge : 노�� 노��를 ��는 ��
Degree : 노�� 딸��는 Edge��
Parent : 부모 노��
Child : �� 노��
Level : 몇��?
Sibling : ��(�� 벨��) 노��
Height : Maximum Level

2. Binary Tree ¶

�� 0 - 2��
�� , ��른��
�� k�� 대 노�� = 2^k - 1
��벨 i�� 대 노�� = 2^(i-1)
n0�� 노�� , n2를 Degree�� 2�� 노�� 면 n0 = n2 + 1 ��는 �� 립��.

3. Binray Tree �� ¶

배��
- ��냥 ��례대�� 는��. 루��, �� , ��른�� .. ��는�� .
- ��덱�� 는
  - Left Child : ��덱�� * 2
  - Right Child : ��덱�� * 2 + 1
  - Parent : ��덱��/2 -> 내림
Linked List
- 노��는 데�� 리��는 링��, ��른�� 리��는 링�� .

4. Binary Tree Traversal ¶

PreOrder : Root -> Left Child -> Right Child : ��러�� 는 방��

~cpp 
PreOrder(a) 
{
    if(a)
    {
        visit a
        Preorder(a->left)
        Preorder(a->right)
    }
}

InOrder : Left Child -> Root -> Right Child : ��리�� 방��

~cpp 
InOrder(a) 
{
    if(a)
    {
        InOrder(a->left)
        visit a
        InOrder(a->right)
    }
}

PostOrder : Left Child -> Right Child -> Root

~cpp 
PostOrder(a) 
{
    if(a)
    {
        PostOrder(a->left)
        PostOrder(a->right)
        visit a
    }
}

LevelOrder : ��벨 �� 방문

~cpp 
AddQ(Root)
while(1)
{
    a = DeleteQ();
    Visit a;
    if(!a) break;
    if(a->left) AddQ(a->left)
    if(a->right) AddQ(a->right)
}

5. Binary Search Trees (��리말�� 리) ¶

�� 는 배�� 른 �� 는 ��리�� .(맞��?--;)
- �� : θ(n)
- �� : θ(log2 n) - 2는 ��. �� 는�� 는��?--;
- n�� 2048�� 면 �� 2048�� 리는 ��면 �� 11밖�� 린��는 말��
- but, �� 면 �� 무�� 뭐�� 됩��. �� 말��. �� 는데 무��..--;
��
- Binray Search Tree �� Binary Tree �� .
- Keys in Left Subtree < Keys of Node
- Keys in Right Subtree > Keys of Node(�� 대�� 말��.)
��리��
- Search x => Compare with Root
  - if x = Root's Key then �� 리��
  - else if x > Root's Key Root를 Right Subtree�� Root�� . ��부��
  - else if x < Root's Key Root를 Left Subtree의 Root로 셋팅. 거기서부터 검색 다시 시작

6. Insert x ¶

루��부�� 맞�� 는 ��른�� 돌�� 맞는 부�� 면 ��.

7. Delete x(�� 복��) ¶

Search x
- 만�� x�� leaf(맨 �� 노��) - ��냥 ��면 �� 뭐..--;
- x�� Child�� 1�� - �� 노�� 들�� 린��. �� 는 ��.(뭔�� ?--;)
- x�� Child�� 2�� - �� 노�� Left Subtree�� 는��. �� y�� 면 y는 ��른�� Child�� . y를 x��리�� 놓��
  - y�� Child ��면 - ��냥 ��.
  - y�� Child ��면 - �� 노��들�� .. ��

8. Tree�� 몇��(Cross Reference �� 변��. C++��는 ��-.-) ¶

~cpp 
// ���리��� ������ ������들

void init(Node** node,char* ch)			// ���������
{
	(*node)->pLeft = (*node)->pRight = NULL;	// ������ ���른��� ������ NULL��
	(*node)->Data = new char[strlen(ch) + 1];	// 문������ ������만��� ������
	strcpy((*node)->Data,ch);			// 노����� 문������ 복���
}

void PrintandDelete(Node* root)			// 맨 ������부��� ������(Preorder������?)
{
    if( root->pLeft )		
        Print( root->pLeft );

    cout << root->Data << endl;

    if( root->pRight )
        Print( root->pRight );

    delete root;					// �������� 노�� ������
}

int Add(Node** root,char* ch)
{
    if(!(*root))					// ���무����� ���������
    {
        *root = new Node;				// ������
        init(root,ch);		   	         // ���������
        return 1;
    }
	
    else if(strcmp((*root)->Data,ch)>0)		// 부모��� ������보��� ���면 ��������� ������
	return add(&((*root)->pLeft),ch);
    else if(strcmp((*root)->Data,ch)<0)		// 부모��� ������보��� ������면 ���른������ ������
	return add(&((*root)->pRight),ch);
    else if(strcmp((*root)->Data,ch)==0)		// ������면 ��������� ������
	return 1;
}

DataStructure

Data Structure/Tree

Contents

1. Tree ��본 ��념들 ¶

2. Binary Tree ¶

3. Binray Tree �� ¶

4. Binary Tree Traversal ¶

5. Binary Search Trees (��리말�� 리) ¶

6. Insert x ¶

7. Delete x(�� 복��) ¶

8. Tree�� 몇��(Cross Reference �� 변��. C++��는 ��-.-) ¶

Data Structure/Tree

Contents

1. Tree ���본 ���념들 ¶

2. Binary Tree ¶

3. Binray Tree ��� ������ ¶

4. Binary Tree Traversal ¶

5. Binary Search Trees (���리말�� ������ ������ ���리) ¶

6. Insert x ¶

7. Delete x(������ ������ 복������) ¶

8. Tree��� �������� ������ 몇������(Cross Reference ������ �������� ������ 변������������. C++��������는 ��������-.-) ¶

1. Tree ��본 ��념들 ¶

3. Binray Tree �� ¶

5. Binary Search Trees (��리말�� 리) ¶

7. Delete x(�� 복��) ¶

8. Tree�� 몇��(Cross Reference �� 변��. C++��는 ��-.-) ¶