binary-tree
常见例句
- Write a function to find the depth of a binary tree.
寫個程序找到一個二叉樹的深度。 - If a binary tree becomes degenerate, we run into the same efficiency problems as we did with the singly linked list.
如果二叉樹變得很不平衡,我們將會碰到同樣的傚率問題如同在持久化單曏鏈表是一樣。 返回 binary-tree