Exam (elaborations)
CSCI 340 Exam 2 Questions and answers latest update
- Course
- CSCI 340
- Institution
- University Of Illinois - Chicago
CSCI 340 Exam 2 Questions and answers latest update
[Show more]
Content preview
CSCI 340 Exam 2Binary Tree ANS✔✔ A binary tree consists of a finite set of nodes that is
either empty, or consists of one specially designated node called the root of the
binary tree, and the elements of two disjoint binary trees called the left subtree
and right subtree of the root.
Complete Binary Tree ANS✔✔ The depth d is the strictly binary tree all of
whose leaves are at level d.
The total number of nodes in a complete binary tree of depth d equals 2d+1 - 1.
Since all leaves in such a tree are at level d, the tree contains 2d leaves and,
therefore, 2d - 1 internal nodes.
Almost Complete Binary Tree ANS✔✔ Each leaf in the tree is either at level
d or at level d - 1.
For any node nd in the tree with a right descendant at level d, all the left
descendants of nd that are leaves are also at level d.
Array and Linked Binary Tree ANS✔✔
http://faculty.cs.niu.edu/~mcmahon/CS241/Notes/bintree.html
Pre-order ANS✔✔ All left, then right (go left if can) then right
http://en.wikipedia.org/wiki/File:Sorted_binary_tree_preorder.svg
, In-Order ANS✔✔ bottom left, then right to parent node, then bottom left of
next, then right.
http://en.wikipedia.org/wiki/File:Sorted_binary_tree_inorder.svg
Post-Order ANS✔✔ Bottom left, then next bottom, then next bottom, to
parent node, then next parent node
http://en.wikipedia.org/wiki/Tree_traversal
Recursive Preorder Traversal Code ANS✔✔ template <class T>
void BTree<T>::preorder(Node<T>* p) const
{
if (p != nullptr)
{
cout << p->data << ' ';
preorder(p->left);
preorder(p->right);
}
}
Recursive Inorder Travesal Code ANS✔✔ template <class T>
void BTree<T>::inorder(Node<T>* p) const
{
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Schoolflix. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $14.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
75759 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now