We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
关于createTree(BiTNode* &T)的解释: 如果不加引用的话,我们只能改变T指针所指数据的内容, 给指针加引用,相当于指针的指针,这样就可以在函数之中改变指针的指向(即指针本身)。
先序创建二叉树,并输出先序中序后序的遍历结果
There was an error while loading. Please reload this page.