modify

cc5a5c7d · 宋海霞 · 8af97102 · cc5a5c7d · cc5a5c7d
--- a/BinaryTree.h
+++ b/BinaryTree.h
 #ifndef BINARYTREE_H_
 #define BINARYTREE_H_
 //
 // Include the C standard library header file here
 //
 #include <stdio.h>
 //
 // Other header files are included here
 //
 //
 // Define the data structure here
 //
@@ -25,18 +20,19 @@
 typedef char ElemType;
-typedef struct BiTNode{
+typedef struct BiTNode
+{
 	ElemType data;				// Binary tree node data
 	struct BiTNode* lchild;		// Left child pointer
 	struct BiTNode* rchild;		// Right child pointer
 }BiTNode, *BiTree;
-typedef enum PushTimes{
+typedef enum PushTimes
+{
 	FirstTime,
 	SecondTime
 }PushTimes;
 //
 // Declare the function here
 //
@@ -46,12 +42,10 @@ BiTNode* CreateNode(ElemType data);
 BiTree InitTree();
 void DeleteTree(BiTree pTree);
 //
 // Declare global variables here
 //
 extern char g_string[MAX_STRING_SIZE];
 extern int g_length;
 #endif /* BINARYTREE_H_ */
--- a/main.c
+++ b/main.c
 #include "BinaryTree.h"
+#include <stdlib.h>
 int main(int argc, char* argv[])
 {
@@ -16,7 +16,7 @@ int main(int argc, char* argv[])
 	//
 	PostOrder(pTree);
-	for(i = 0; i < g_length - 1; i++)
+	for (i = 0; i < g_length - 1; i++)
 	{
 		printf("%c", g_string[i]);
 	} 
@@ -41,13 +41,17 @@ returned value:
 	Returns 1 if the traversal succeeds
 	Returns 0 if the traversal fails
 */
-char g_string[MAX_STRING_SIZE];		// String. Used to save the postscript sequence of a binary tree during traversal
+// String. Used to save the postscript sequence of a binary tree during traversal
+char g_string[MAX_STRING_SIZE];		
 int g_length = 0;					// The string length.0 indicates an empty string
 int PostOrder(BiTree pTree)
 {
 	BiTNode* Stack[MAX_STACK_SIZE];				// Stack. Used to store parent nodes
-	enum PushTimes TimesStack[MAX_STACK_SIZE];	// Stack. Used to store the number of times the parent node is pushed
+	// Stack. Used to store the number of times the parent node is pushed
-	int top = 0;								// Both stacks use the same top of the stack.0 means empty stack
+	enum PushTimes TimesStack[MAX_STACK_SIZE];	
+	// Both stacks use the same top of the stack.0 means empty stack
+	int top = 0;								
 	BiTNode* pNode;			// Binary tree node pointer
 	enum PushTimes Times;	// Number of parent pushed on the stack
@@ -80,6 +84,15 @@ BiTNode* CreateNode(ElemType data)
 	return pNode;
 }
+// A binary tree preordered sequence string.
+// notice:Using only preordered sequences does not determine a unique binary tree.
+// So, two Spaces after the leaf node,
+// Also, the sequence ends with the character '\0' at the end of the string.
+// In this way, the preordering sequence determines the unique binary tree.
+static const char* data = "-*a  -b  c  /d  e";	
+static int nIndex = 0;	// The index of the binary tree first order sequence
 /*
 function:
 	Create a binary tree from the preordered sequence of the binary tree.
@@ -87,28 +100,24 @@ function:
 returned value:
 	Return pointer to a binary tree
 */
-static const char* data = "-*a  -b  c  /d  e";	// A binary tree preordered sequence string.
-												// notice:Using only preordered sequences does not determine a unique binary tree.
-												// So, two Spaces after the leaf node,
-												// Also, the sequence ends with the character '\0' at the end of the string.
-												// In this way, the preordering sequence determines the unique binary tree.
-static int nIndex = 0;	// The index of the binary tree first order sequence
 BiTree InitTree()
 {
 	BiTNode* pRootNode;
-	if('\0' == data[nIndex])	// End of preordering sequence string of binary tree
+	if ('\0' == data[nIndex])	// End of preordering sequence string of binary tree
+	{
 		pRootNode = NULL;
+	}		
 	else
 	{
 		//
-		// Create parent node
+		// Create parent node,Empty nodes must be ignored
 		//
-		pRootNode = (' ' == data[nIndex] ? NULL : CreateNode(data[nIndex]));	// Empty nodes must be ignored
+		pRootNode = (' ' == data[nIndex] ? NULL : CreateNode(data[nIndex]));
 		nIndex++;
 	}
-	if(pRootNode != NULL)
+	if (pRootNode != NULL)
 	{
 		//
 		// Recursion is used to implement the first order traversal algorithm
@@ -135,7 +144,7 @@ void DeleteTree(BiTree pTree)
 	//
 	// The sequential traversal algorithm is implemented by recursion
 	//
-	if(pTree != NULL)
+	if (pTree != NULL)
 	{
 		DeleteTree(pTree->lchild);
 		DeleteTree(pTree->rchild);