{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# rec03 - 6.006 Intro to Algorithms Recitation 03 February 9...

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

6.006 Intro to Algorithms Recitation 03 February 9, 2011 Binary Search Tree A binary search tree is a data structure that allows for key lookup, insertion, and deletion. It is a binary tree, meaning every node of the tree has at most two child nodes, a left child and a right child. Each node of the tree holds the following information: x .key - Value stored in node x x .left- Pointer to the left child of node x . NIL if x has no left child x .right - Pointer to the right child of node x . NIL if x has no right child x .parent - Pointer to the parent node of node x . NIL if x has no parent, i.e. x is the root of the tree Later on this week, we will learn about binary search trees that holds data in addition to the four listed above but for now we will focus on the vanilla binary search tree. A binary search tree has two simple properties: For each node x , every value found in the left subtree of x is less than or equal to the value found in x For each node x , every value found in the right subtree of x is greater than or equal to the value found in x

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

View Full Document
6.006 Intro to Algorithms Recitation 03 February 9, 2011 BST Operations There are operations of a binary search tree that take advantage of the properties above to search for keys. There are other operations that manipulate the tree to insert new key or remove old ones
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