Week 7 Workshop 5 Hierarchical Data Structures Part 1

0 11 フィッシュ up804653

学び始める

mp3をダウンロードする印刷遊びます自分をチェック

質問		答え
What is a general tree/ multi branch tree? 学び始める		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? 学び始める		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 学び始める		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? 学び始める		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? 学び始める		another word for terminal node
what is a root node? 学び始める		The topmost node in the tree is called the root.
what is a branch? 学び始める		a line of linked nodes
what is meant by degree of a node 学び始める		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 学び始める		the number of parent nodes a tree node has
what is height/depth of a tree 学び始める		The depth of a node is the number of edges from the node to the tree's root node.
what is a balanced ST 学び始める		A balanced tree is one in which all paths from the root node to the leaf nodes are of the same length.

フラッシュカードを作成する

コメントを投稿するにはログインする必要があります。