Examen
CSCI 340 Exam 2 Questions and answers latest update
- Grado
- CSCI 340
- Institución
- University Of Illinois - Chicago
CSCI 340 Exam 2 Questions and answers latest update
[Mostrar más]Vista previa 2 fuera de 5 páginas
Vista previa 2 fuera de 5 páginas
Añadir al carrito
Vista previa del contenido
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
{
Los beneficios de comprar resúmenes en Stuvia estan en línea:
Garantiza la calidad de los comentarios
Compradores de Stuvia evaluaron más de 700.000 resúmenes. Así estas seguro que compras los mejores documentos!
Compra fácil y rápido
Puedes pagar rápidamente y en una vez con iDeal, tarjeta de crédito o con tu crédito de Stuvia. Sin tener que hacerte miembro.
Enfócate en lo más importante
Tus compañeros escriben los resúmenes. Por eso tienes la seguridad que tienes un resumen actual y confiable. Así llegas a la conclusión rapidamente!
Preguntas frecuentes
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.
100% de satisfacción garantizada: ¿Cómo funciona?
Nuestra garantía de satisfacción le asegura que siempre encontrará un documento de estudio a tu medida. Tu rellenas un formulario y nuestro equipo de atención al cliente se encarga del resto.
Who am I buying this summary 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 this summary for $14.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
45,681 summaries were sold in the last 30 days
Founded in 2010, the go-to place to buy summaries for 15 years now
Vistos recientemente
Resumen ·
Internationaal Publiekrecht - Samenvatting kort
Examen ·
Obesity Week 4 Health Policy Analysis NR506NP
Lote ·
ATI PN Comprehensive Online Practice 2020 B
Resumen ·
Samenvatting kennislijn A: wiskunde en rekenen
Examen ·
ENG1501 Assignment 2 2024 (371427) - 11 June 2024
Notas de lectura ·
Class notes Approche du développement durable
Examen ·
Exam (elaborations) NCLEX Exam NCLEX-PN (NCLEXPN)
Examen ·
NURS 460 - Quiz 1 Questions and answers latest update
