Esempi in C++ (Cpp) per post_order_traverse

Esempio n. 1

File: binary_sort_tree.c Progetto: JacksonZhangkun/coding

void post_order_traverse(BiTree T){
    if (T == NULL)
	return;
    post_order_traverse(T->lchild);
    post_order_traverse(T->rchild);
    printf("%d ",T->data);
}

Esempio n. 2

File: main.c Progetto: laurie-bai/algorithm

void post_order_traverse(Node *node)
{
	if (node == NULL)
		return;
	post_order_traverse(node->lchild);
	post_order_traverse(node->rchild);
	printf("%c\n", node->data);
}

Esempio n. 3

File: binary_tree.c Progetto: guhowo/Data_Structure_and_Algorithms

/**
 *
 * \brief
 *  Postoder traverse a binary tree 
 *
 * \param	root	The root of a binary tree (input)
 *
 * \return	none.
 *
 */
void post_order_traverse(BiNode *root)
{
	if(NULL == root)
	{
		return;
	}

	post_order_traverse(root->lchild);
	post_order_traverse(root->rchild);
	printf("%s\t", root->name);
}

Esempio n. 4

File: main.c Progetto: laurie-bai/algorithm

int main(int argc, char *argv[])
{
	char *preorder = "ABDHECFG";
	char *inorder  = "HDBEAFCG";
	
	Node *root = get_binary_tree(preorder, inorder, 8);
	post_order_traverse(root);

	return 0;
}