Week 7 Workshop 5 Hierarchical Data Structures Part 1

0 11 flashcards up804653

start learning

download mp3 print play test yourself

Question		Answer
What is a general tree/ multi branch tree? start learning		The hierarchical (or tree) data structure consists of a collection of nodes (elements) where each node has a unique predecessor and many successors.
What is a binary tree? start learning		a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.
What is a binary search tree start learning		a binary tree where each node has a Comparable key (and an associated value) and the key in any node is larger than the keys in all nodes in that node's left subtree and smaller than the keys in all nodes in that node's right subtree.
What is a sub tree? start learning		The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree. and consists of all the nodes below on the branch
what is a leaf? start learning		another word for terminal node
what is a root node? start learning		The topmost node in the tree is called the root.
what is a branch? start learning		a line of linked nodes
what is meant by degree of a node start learning		The degree of a node in a network (sometimes referred to incorrectly as the connectivity) is the number of connections or edges the node has to other nodes.
what is level of a node start learning		the number of parent nodes a tree node has
what is height/depth of a tree start learning		The depth of a node is the number of edges from the node to the tree's root node.
what is a balanced ST start learning		A balanced tree is one in which all paths from the root node to the leaf nodes are of the same length.

Create flashcards

You must sign in to write a comment