摘要:
【中序遍历】中序遍历非递归遍历算法:遇到一个结点,就把它压栈,并去遍历它的左子树;当左子树遍历结束后,从栈顶弹出这个结点并访问它;然后按其右指针再去中序遍历该结点的右子树; 1 void InOrderTraversal_ext(BinTree Bt) 2 { 3 BinTree pStac... 阅读全文
摘要:
QUESTION :What books does Bjarne Stroustrup suggest to master C++?ANSWER:A Tour of C++is a quick (about 180 pages) tutorial overview of all of standar... 阅读全文