tutorial10

tutorial10 - CSC2100B CSC2100B DataStructures Tutorial10...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
CSC 2100B CSC 2100B Data Structures Data Structures Tutorial 10 Tutorial 10  27 March 2007 Carmen Lam Email:  [email protected] Office: SHB 1026
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
2 Q.1 Q.1 Root  2 marks a Leaf  2 marks e    or  g    or h    or  j     or k    or m Intermediate node  2 marks b    or c    or d    or f
Background image of page 2
3 Q.1 Q.1 Ancestor  2 marks a is an ancestor of b / c / d / e / f / g / h / j / k / m   or b is an ancestor of d / e / f / j / k / m                       or c is an ancestor of g / h          or d is an ancestor of j / k           or f is an ancestor of m Sibling  2 marks b and c       or d, e and f    or g and h       or j and k  
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Q.2 Q.2 public static int AVLTotalNumberOfNodes(AVLTree T) { if (T.isEmpty())
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 15

tutorial10 - CSC2100B CSC2100B DataStructures Tutorial10...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online