Binary tree _Alpha (need modify)

Binary tree _Alpha (need modify)

  9월 30, 2019    !!

---

"binary tree.h" 12345678910111213141516171819202122232425262728293031323334353637#ifndef _BINARY_TREE_#define _BINARY_TREE_ struct Child_Node_Type_Of_Binary_Tree {     char data;     struct Child_Node_Type_Of_Binary_Tree* Pointer_Left_Child;    struct Child_Node_Type_Of_Binary_Tree* Pointer_Right_Child;}; struct Parents_Node_Type_Of_Binary_Tree {     struct Child_Node_Type_Of_Binary_Tree* Pointer_Root;}; struct Binary_Tree_Type {     int Number_Of_Current_Elements;     struct Parents_Node_Type_Of_Binary_Tree* Header;}; struct Binary_Tree_Type* Create_Binary_Tree(void);int Insert_Binary_Tree_Element(struct Binary_Tree_Type* Pointer_Binary_Tree, struct Child_Node_Type_Of_Binary_Tree element);void Display_Binary_Tree(struct Binary_Tree_Type* Pointer_Binary_Tree, int level, char type); #endif // !_BINARY_TREE_ #ifndef _COMMON_DEFINITION_#define _COMMON_DEFINITION_ #define TRUE    1#define FALSE    0 #endif // !_COMMON_DEFINITION_ Colored...

Read More

Linked deque _Alpha

Linked deque _Alpha

  9월 29, 2019    !!

---

"linked deque.h" 1234567891011121314151617181920212223242526272829303132333435363738394041#ifndef _LINKED_DEQUE_#define _LINKED_DEQUE_ struct Deque_Node_Type {     char data;     struct Deque_Node_Type* Pointer_Above;    struct Deque_Node_Type* Pointer_Below;}; struct Linked_Deque_Type {     int Number_Of_Current_Element;     struct Deque_Node_Type Top_Header;    struct Deque_Node_Type Bottom_Header;}; struct Linked_Deque_Type* Create_Linked_Deque(void);int Push_In_The_Top_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque, struct Deque_Node_Type element);int Push_In_The_Bottom_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque, struct Deque_Node_Type element);struct Deque_Node_Type* Pop_In_The_Top_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque);struct Deque_Node_Type* Pop_In_The_Bottom_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque);struct Deque_Node_Type* Peek_In_The_Top_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque);struct Deque_Node_Type* Peek_In_The_Bottom_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque);void Delete_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque); int Is_Linked_Deque_Empty(struct Linked_Deque_Type* Pointer_Deque);int Get_Number_Of_Elements_In_The_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque);void Display_Linked_Deque(struct Linked_Deque_Type* Pointer_Deque); #endif // !_LINKED_DEQUE_ #ifndef _COMMON_DEFINITION_#define _COMMON_DEFINITION_ #define TRUE    1#define FALSE    0 #endif // !_COMMON_DEFINITION_Colored...

Read More