假設你已經有基本的二叉樹程序isempty(bt),root(bt),left(bt)和right(bt)。編寫一個過程isLeaf(bt),如果二叉樹bt是葉節點,則返回true;如果不是,則返回false。二叉樹計數葉數
這是我有:
proc isLeaf(bt)
if (isEmpty(bt))
error('The binary tree is empty.');
elseif (left(bt) < right(bt))
return true;
else return false;
然後寫了一個程序numLeaves(BT)返回二叉樹BT葉子的數量。
這是我有:
proc numLeaves(bt)
if (isEmpty(bt))
error ('The binary tree is empty.');
elseif (count left(bt) + right(bt));
return (left(bt) + right(bt);
請你能正確嗎?
你認爲什麼是錯呢? – Matt 2011-02-08 11:05:41