08 2013 档案

微软百题16:按树的层次打印节点
摘要：typedef struct TreeNode{int value;TreeNode * left;TreeNode * right;}TreeNode;void CreateTree( TreeNode * & pTreeNode, int value){if( pTreeNode == NULL){pTreeNode = (TreeNode *) new TreeNode;pTreeNode ->left = NULL;pTreeNode ->right = NULL;pTreeNode ->value = value;}else if( pTreeNode -& 阅读全文
posted @ 2013-08-11 16:24 sorgin 阅读(151) 评论(0) 推荐(0) 编辑
微软应聘百题五十二: 求二元树的深度
摘要：int PreOrder( TreeNode * pTreeNode, int levNum ){if( pTreeNode == NULL)return levNum;//printf("%d,", pTreeNode->value );levNum ++;int sum1= PreOrder(pTreeNode->left,levNum) ;int sum2 = PreOrder(pTreeNode->right,levNum);return (sum1>sum2?sum1:sum2);} 阅读全文
posted @ 2013-08-11 16:15 sorgin 阅读(150) 评论(0) 推荐(0) 编辑