자료구조

#include #include #define _CRT_SECURE_NO_WARNINGS #define max(a, b) (((a) > (b)) ? (a) : (b)) int BN[100] = {0}; int cnt = 0; typedef struct TreeNode { int key; int balance; struct TreeNode *left, *right; } TreeNode; int get_height(TreeNode *node) { int height = 0; if (node != NULL) { height = 1 + max(get_height(node->left), get_height(node->right)); } return height; } int get_balance(TreeNode *..

#define _CRT_SECURE_NO_WARNINGS #include #include #include #define MAX_STACK_SIZE 200 typedef struct { int stack[MAX_STACK_SIZE]; int top; } StackType; void init(StackType *s) { memset(s->stack, 0, sizeof(int) * MAX_STACK_SIZE); s->top = -1; } int is_empty(StackType *s) { return (s->top == -1); } int is_full(StackType *s) { return (s->top == (MAX_STACK_SIZE - 1)); } void push(StackType *s, char ..