This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Complete tree of height h, C h : an empty tree is C1 if h > 1, then C h is {r, T L , T R }, and either: T L is _______ and T R is ________ OR T L is _______ and T R is ________ P : P 1 : P 2 : Perfect tree of height h, P h : P1 is an empty tree if h > 1, then P h is {r, T L , T R }, where T L and T R are P h1 . Rooted, directed, ordered, binary trees ADT: insert remove traverse template <class T> class tree{ public: private: struct treeNode{ T data; treeNode * left; treeNode * right; }; treeNode * root }; Implementation: Theorem: if there are n data items in a binary tree, then there are ______ null pointers....
View Full
Document
 Spring '09
 Heeren

Click to edit the document details