int tree Leaf Node Leaf 1 Leaf Node

  • Slides: 27
Download presentation

이진 나무 구조 – int tree • Leaf • Node (Leaf, 1, Leaf) •

이진 나무 구조 – int tree • Leaf • Node (Leaf, 1, Leaf) • Node (Leaf, 1, Node(Leaf, 2, Leaf)) 1 1 2 4

이진 나무 구조 – int tree • Node(Leaf, 2, Leaf), 1, Node(Leaf, 3, Node(Leaf,

이진 나무 구조 – int tree • Node(Leaf, 2, Leaf), 1, Node(Leaf, 3, Node(Leaf, 4, Leaf))) 1 2 3 4 5

preorder • 이진 나무를 받아서 나무의 원소들을 앞순위 나열한 리스트를 계산하는 함수 preorder를 작성하라.

preorder • 이진 나무를 받아서 나무의 원소들을 앞순위 나열한 리스트를 계산하는 함수 preorder를 작성하라. • # preorder; ; - : 'a tree -> 'a list = <fun> # preorder Leaf; ; - : 'a list = [] # preorder (Node(Leaf, 1, Leaf), 2, Node(Leaf, 3, Leaf), 4, Node(Leaf, 5, Leaf)))); ; - : int list = [2; 1; 4; 3; 5] 9

postorder • 이진 나무를 받아서 나무의 원소들을 뒷순위 나열한 리스트를 계산하는 함수 postorder를 작성하라.

postorder • 이진 나무를 받아서 나무의 원소들을 뒷순위 나열한 리스트를 계산하는 함수 postorder를 작성하라. • # postorder; ; - : 'a tree -> 'a list = <fun> # postorder Leaf; ; - : 'a list = [] # postorder (Node(Leaf, 1, Leaf), 2, Node(Leaf, 3, Leaf), 4, Node(Leaf, 5, Leaf)))); ; - : int list = [1; 3; 5; 4; 2] 10

inorder • 이진 나무를 받아서 나무의 원소들을 안순위 나열한 리스트를 계산하는 함수 inorder를 작성하라.

inorder • 이진 나무를 받아서 나무의 원소들을 안순위 나열한 리스트를 계산하는 함수 inorder를 작성하라. • # inorder; ; - : 'a tree -> 'a list = <fun> # inorder Leaf; ; - : 'a list = [] # inorder (Node(Leaf, 1, Leaf), 2, Node(Leaf, 3, Leaf), 4, Node(Leaf, 5, Leaf)))); ; - : int list = [1; 2; 3; 4; 5] 11

preorder • let rec preorder t = match t with | Node (l, v,

preorder • let rec preorder t = match t with | Node (l, v, r) -> v : : ((preorder l) @ (preorder r)) | Leaf -> [] ; ; 12

postorder • let rec postorder t = match t with | Node (l, v,

postorder • let rec postorder t = match t with | Node (l, v, r) -> (postorder l) @ (postorder r) @ [v] | Leaf -> [] ; ; 13

inorder • let rec inorder t = match t with | Node (l, v,

inorder • let rec inorder t = match t with | Node (l, v, r) -> (inorder l) @ [v] @ (inorder r) | Leaf -> [] 14

insert • 이진 검색 나무에 새 원소를 추가하는 함수 insert 를 작성하라. • #

insert • 이진 검색 나무에 새 원소를 추가하는 함수 insert 를 작성하라. • # insert; ; - : 'a tree -> ‘a -> 'a tree = <fun> # insert Leaf 1; ; - : int tree = Node (Leaf, 1, Leaf) # insert (Node(Leaf, 1, Leaf), 3, Node(Leaf, 5, Leaf), 6, Leaf))) 4; ; - : int tree = Node (Leaf, 1, Leaf), 3, Node (Node (Leaf, 4, Leaf), 5, Leaf), 6, Leaf)) 17

insert • let rec insert t x = match t with | Node (l,

insert • let rec insert t x = match t with | Node (l, v, r) -> if x = v then t else if x < v then Node(insert l x, v, r) else Node(l, v, insert r x) | Leaf -> Node(Leaf, x, Leaf) 18

search • 이진 검색 나무에서 값을 찾는 함수 search를 작성 하라. • # search;

search • 이진 검색 나무에서 값을 찾는 함수 search를 작성 하라. • # search; ; - : 'a tree -> ‘a -> 'a option = <fun> # search Leaf 1; ; - : int option = None # search (Node(Leaf, 1, Leaf), 3, Node(Leaf, 5, Leaf), 6, Leaf))) 5; ; - : int option = Some 5 20

search • let rec search t x = match t with | Leaf ->

search • let rec search t x = match t with | Leaf -> None | Node (l, v, r) -> if v = x then Some x else if v > x then search l x else search r x ; ; 21

check_smaller & check_larger • let rec check_smaller t x = (내용) and check_larger t

check_smaller & check_larger • let rec check_smaller t x = (내용) and check_larger t x = (내용) ; ; • • # check_smaller; ; - : 'a tree -> 'a -> bool = <fun> # check_larger; ; - : 'a tree -> 'a -> bool = <fun> # check_smaller (Node (Leaf, 1, Leaf), 3, Node (Leaf, 5, Leaf))) 6; ; - : bool = true # check_smaller (Node (Leaf, 1, Leaf), 3, Node (Leaf, 5, Leaf))) 4; ; - : bool = false 24

check_smaller & check_larger • let rec check_smaller t x = match t with |

check_smaller & check_larger • let rec check_smaller t x = match t with | Leaf -> true | Node (l, y, r) -> y < x && check_smaller l y && check_larger r y && check_smaller r x and check_larger t x = match t with | Leaf -> true | Node (l, y, r) -> y > x && check_smaller l y && check_larger r y && check_larger l x ; ; 25

check • let check t = match t with | Leaf -> true |

check • let check t = match t with | Leaf -> true | Node (l, v, r) -> check_smaller l v && check_larger r v ; ; 27

Node node 1 new Node node 1 dataNode node 1 new Node node 1 data
Trie struct node int next26 int fail intTrie struct node int next26 int fail int
CLASS 5 int myabsint int rectint int intCLASS 5 int myabsint int rectint int int
typedef int Int A10 Int A a Inttypedef int Int A10 Int A a Int
int mainvoid int x2 xinitial2 int p5 intint mainvoid int x2 xinitial2 int p5 int
IO int a7 int b6 int c5 intIO int a7 int b6 int c5 int
CLASS 5 int myabsint int rectint int intCLASS 5 int myabsint int rectint int int
int add 3 int a int b intint add 3 int a int b int
class Binary Tree Node public Binary Tree Nodeclass Binary Tree Node public Binary Tree Node
struct Tree Node string element Tree Node firststruct Tree Node string element Tree Node first
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
struct tree tree int n struct tree newtreestruct tree tree int n struct tree newtree
Binary tree Expression tree Huffman tree Tree traversalsBinary tree Expression tree Huffman tree Tree traversals
Binary tree Expression tree Huffman tree Tree traversalsBinary tree Expression tree Huffman tree Tree traversals
Tree Binary Tree Binary Search Tree 2 TreeTree Binary Tree Binary Search Tree 2 Tree
Leaf Miners The Holly Leaf Miner Leaf MinersLeaf Miners The Holly Leaf Miner Leaf Miners
Leaf Anatomy Cross Section of a Leaf LeafLeaf Anatomy Cross Section of a Leaf Leaf
node leaf 2 3 3 4 node leaf2leafnode leaf 2 3 3 4 node leaf2leaf
node leaf 2 3 3 4 node leaf2leafnode leaf 2 3 3 4 node leaf2leaf
DOM Document node html node body node hDOM Document node html node body node h
Node 1 DB 1 Node 2 Node 3Node 1 DB 1 Node 2 Node 3
struct node struct node next typedef struct nodestruct node struct node next typedef struct node
public void search Node node if node getpublic void search Node node if node get