二叉树基本操作 (三)
Child( pTree, pTree->pRoot, CreateNode( 1 ));
Node* pRight = AppendRightChild( pTree, pTree->pRoot, CreateNode( 2 ));
AppendLeftChild( pTree, pLeft, CreateNode( 3 ));
AppendRightChild( pTree, pLeft, CreateNode( 4 ) );
AppendLeftChild( pTree, pRight, CreateNode( 5 ));
pRight = AppendRightChild( pTree, pRight, CreateNode( 6 ));
puts( "Tree leaves:" );
printf( "%d\n", GetTreeLeaves( pTree->pRoot ) );
puts( "Tree Depth:" );
printf( "%d\n", GetTreeDepth( pTree->pRoot ) );
puts( "" );
Traverese( pTree->pRoot );
DeleteEntireNode( pTree, &pRight );
puts( "Tree leaves:" );
printf( "%d\n", GetTreeLeaves( pTree->pRoot ) );
ClearTree( &pTree );
DestroyTree( &pTree );
if( pTree )
Traverese( pTree->pRoot );
return 0;
}