diff --git a/树/二叉树的顺序存储.c b/树/二叉树的顺序存储.c
new file mode 100644
index 0000000..feb15ed
--- /dev/null
+++ b/树/二叉树的顺序存储.c
@@ -0,0 +1,22 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<stdbool.h>
+#define MaxSize 100
+
+typedef struct TreeNode{
+	int value;
+	bool isEmpty;
+}TreeNode;
+
+TreeNode* InitTree(){
+	TreeNode t[MaxSize];
+	for(int i=0;i<MaxSize;i++){
+		t[i].isEmpty = true;
+	}
+	return t;
+}
+
+int main(){
+	TreeNode *t = InitTree();
+	return 0;
+}