二元樹

出自維基百科,自由嘅百科全書
跳去導覽 跳去搵嘢

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

Binary tree v2.svg

睇埋[編輯]

[編輯]

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