binominal tree

 
  • 二叉樹

binominal tree的用法和樣例:

例句

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

binominal tree的相關資料:

臨近單詞

今日熱詞
目錄 附錄 查詞歷史