This document discusses tree data structures and binary trees. It contains the following information: - Binary trees are a type of tree data structure where each node has at most two children, described as left and right. Nodes without children are called leaves and nodes with children are branch nodes. - The level of a node is the number of edges from that node to the root node. For example, the root node is at level 0. - Two binary trees are equal if they have the same structure and corresponding nodes contain the same data. - Examples of binary trees are given to illustrate tree structure and traversal algorithms like depth-first and breadth-first search. Notation for representing trees with parentheses is also

1. TAOCP 2.3
twitter.com/jun0683

2. 0
,

4. (degree) :
(terminal node), (leaf) : 0
: (branch node)
(level) : , ex) root 0

5. G
D E F
B C
A
15

6. G
D E F
B C
A
15

7. G
D E F
B C
A
15

8. G 3
D E F 2
B C 1
A 0
15

9. G
D E F
3
B C
A
15

10. G
D E F
B C
A
15

11. ,
( ):
:

12. G G
D E F D E F
≠
B C C B
A A
15 16

13. G G
D E F D E F
=
B C C B
A A
15 16

14. :0

15. A
B C
D E F
G

17. ..

18. A
B C
D E D E F
G
19

19. A
B C
D E D E F
G
19

20. A
B C
D E D E F
G
19

21. A
B C
D E D E F
G
19

22. A
B C
D E D E F
G
19

23. ex) ,
2
,

24. ≠
2
. .
or

25. a-b(c/d+e/f) -
a x
b +
/ /
c d e f

26. 10
1 A;
1.1 B;
A
1.1.1 H;
1.1.2 j: B C
1.2 C;
1.2.1 D; D E D E F
1.2.2 E;
1.2.2.1 G;
G
1.2.3 F;

27. 0
L = (a,(b,a,b),(),c,(((2))))
*
a * * *
*
b a b
*
2

28. 8. ?

29. 8. ?
.
-> .

30. 15. 10
.

31. 10
1 A;
1.1 B;
A
1.1.1 H;
1.1.2 j: B C
1.2 C;
1.2.1 D; D E D E F
1.2.2 E;
1.2.2.1 G;
G
1.2.3 F;

32. 15. 10
.
2
-> 1 0 ,1
a
1 a;
10 b;
b c
11 c;
111 d; d