二元樹

出自維基百科,自由嘅百科全書

二元樹ji6 jyun4 syu6英文binary tree)係種好出名嘅樹型數據,指樖樹每粒節點頂攏得兩粒子節點,好似下圖噉就算係一樖二元樹[1]

睇埋[編輯]

[編輯]

  1. Rowan Garnier; John Taylor (2009). Discrete Mathematics:Proofs, Structures and Applications, Third Edition. CRC Press. p. 620.