{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# Ch8 - C Plus Data Structures Nell Dale Chapter 8 Binary...

This preview shows pages 1–18. Sign up to view the full content.

1 Nell Dale Chapter 8 Binary Search Trees Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus C++ Plus Data Structures

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

View Full Document
2 Jake’s Pizza Shop Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len
3 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len A Tree Has a Root Node ROOT NODE

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

View Full Document
4 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len Leaf nodes have no children LEAF NODES
5 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len A Tree Has Levels LEVEL 0

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

View Full Document
6 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len Level One LEVEL 1
7 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len Level Two LEVEL 2

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

View Full Document
8 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len A Subtree LEFT SUBTREE OF ROOT NODE
9 Owner Jake Manager Chef Brad Carol Waitress Waiter Cook Helper Joyce Chris Max Len Another Subtree RIGHT SUBTREE OF ROOT NODE

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

View Full Document
10 A binary tree is a structure in which: Each node can have at most two children, and in which a unique path exists from the root to every other node. The two children of a node are called the left child and the right child, if they exist. Binary Tree
11 A Binary Tree Q V T K S A E L

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

View Full Document
12 How many leaf nodes? Q V T K S A E L
13 How many descendants of Q? Q V T K S A E L

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

View Full Document
14 How many ancestors of K? Q V T K S A E L
15 Implementing a Binary Tree with Pointers and Dynamic Data Q V T K S A E L

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

View Full Document
16 Each node contains two pointers template< class ItemType > struct TreeNode { ItemType info; // Data member TreeNode<ItemType>* left; // Pointer to left child TreeNode<ItemType>* right; // Pointer to right child }; . left . info . right NULL ‘A’ 6000
// BINARY SEARCH TREE SPECIFICATION template< class

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern