Re: Binary Search Tree

Peter_APIIT · #11 17-Mar-2008, 02:12

My postorderdisplay function did not display correctly.

Here is the code :

CPP / C++ / C Code:

// -----------------------------------------------------
void PostorderDisplay(struct BST *BST)
{
	// Left->Right->Root

	printf("\n\n\t\t    Postorder Traversal Display\n");
	if (BST->root != NULL)
	{
		RecursivePostorderDisplay(BST->root);
	}
	else
	{
		exit(0);
	}
}
// -------------------------------------------------------
void RecursivePostorderDisplay(struct Tree_Node *Tree_Node)
{
	if (Tree_Node != NULL)
	{
		if (Tree_Node->leftNode != NULL)
		{
			RecursiveInorderDisplay(Tree_Node->leftNode);
		}

		if (Tree_Node->rightNode != NULL)
		{
			RecursiveInorderDisplay(Tree_Node->rightNode);
		}

		printf("\n\t\t\tValue of node : %d", Tree_Node->value);
	}
	else
	{
		exit(0);
	}
}

Anything wrong with it ?

Thanks for your help

Peter_APIIT · #12 18-Mar-2008, 03:56

How to calculate this equation in C code?

CPP / C++ / C Code:

  
2 ^ h = 8; Assume h = 3;

My friends told me that use 8 /2 = Number of division is the answers until the last number is 1.

The purpose of this function is to output a minimum height of a VST can formed when certain nodes is given by user or achieved this by API.

A billion thanks for your help.

seprich · #13 18-Mar-2008, 05:21

Quote:

Originally Posted by Peter_APIIT

CPP / C++ / C Code:

// -------------------------------------------------------
void RecursivePostorderDisplay(struct Tree_Node *Tree_Node)
{
	if (Tree_Node != NULL)
	{
		if (Tree_Node->leftNode != NULL)
		{
			RecursiveInorderDisplay(Tree_Node->leftNode);
		}

		if (Tree_Node->rightNode != NULL)
		{
			RecursiveInorderDisplay(Tree_Node->rightNode);
		}

		printf("\n\t\t\tValue of node : %d", Tree_Node->value);
	}
	else
	{
		exit(0);
	}
}

One could assume that instead of calling "RecursiveInorderDisplay" you should call "RecursivePostorderDisplay". However please explain if your intention is something not directly obvious.

Then also the "exit(0);" seems out of place.

Peter_APIIT · #14 20-Mar-2008, 00:11

Another pair of eyes is the most useful debugger tool i have seen before.

How about calculate min height give a specific node ?

Thread Tools	Search this Thread
Show Printable Version Email this Page	Search this Thread: Advanced Search
Rate This Thread
Rate This Thread:

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Deleting a node from binary search tree	earachefl	C++ Forum	3	28-Jun-2006 08:26
can anyone help me with my tree :)	bioeng_mtm	C++ Forum	5	22-Apr-2006 13:50
Binary Search Tree in C++	rpg3	C++ Forum	5	02-Apr-2006 10:53
printing binary search tree	nkhambal	C Programming Language	2	26-Mar-2005 04:01
Search Engine Positioning 101 and 201 "How To" Tips...	000	Search Engine Optimization Forum	0	29-May-2003 11:34