Y

@Yeong

BST

C
1 hour ago
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> typedef int TElement; typedef struct TNode { TElement data; struct TNode* left; struct TNode* right;

내림차순 BST

C
2 hours ago
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> typedef int TElement; typedef struct TNode { TElement data; struct TNode* left; struct TNode* right;

오름차순 BST

C
2 hours ago
#define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include <stdlib.h> typedef int TElement; typedef struct TNode { TElement data; struct TNode* left; struct TNode* right;

BST활용

C
2 hours ago
#include <stdio.h> #include <stdlib.h> typedef struct Node { int data; struct Node* left; struct Node* right; } Node; Node* create_node(int key) {

이진 순회 트리

C
6 days ago
#include <stdio.h> #include <stdlib.h> typedef char TElement; typedef struct TNode{ TElement data; struct TNode* left; struct TNode* right; }TNode;

G_덱

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node* prev; struct Node* next; }Node; struct Node* front = NULL;

H_동적메모리할당queue

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> int* queue; int front = 0; int rear = 0; int MAX_SIZE; int is_empty(){ if(front == rear){

E_stack_동적할당

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node* next; }Node; struct Node* top = NULL;

D_후위계산식

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> #define MAX_SIZE 100 int data[MAX_SIZE]; int top = -1; int is_empty(){ if(top == -1){

C_reverse

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node* next; }Node; struct Node* top = NULL;

B_버터떡웨이팅

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> #define MAX_SIZE 6 int queue[MAX_SIZE]; int front = 0; int rear = 0; int is_empty(){

A_중간삽입stack

C
3 weeks ago
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node* next; }Node; struct Node* top = NULL;