第六章 Trees：introduce some about trees6.1Motivation:Two Types of Genealogical Charts[单选题]
6.2Introduction to Trees:introduce some Terminology such as Height, Depth, Forest Leaf, Siblings, Degree
6.3Trees List Representation:List Representation of Tree
6.4Introduction to Binary Tress:introduce some Binary Trees
6.5Binary Tree Representations:introduce Full Binary Tree and Lemmas
6.6Expression Tree:Expression Tree and Array Representation
6.7Binary Tree Implementation:Implementation of Binary Trees
6.8Operations on Binary Tree:Operations on Binary Trees and Binary Tree Traversal
6.9Binary Tree Traversal:Preorder Traversal
6.10Binary Search Tress:Binary Search Tree and his advantages
To represent hierarchical relationship between elements, which data structure is suitable?
选项:[ array, tree
, stack
, queue
]
[单选题]What is the maximum number children that a binary tree node can have?选项:[0
, 1, 2, 3]
[单选题]The inorder traversal of tree will yield a sorted listing of elements of tree in选项:[ Binary trees
, Binary search trees
, Heaps
, None of the above
]
[单选题]If we store the nodes of a binary tree in an array with index starting from zero, the right child of a node having index n can be obtained at: 选项:[(n-1)/2
, n+1, 2n+2
, 2n+1
]
[单选题]
Which of the following traversal outputs the data in sorted order in a BST?
选项:[ Level order, Postorder
, Inorder
, Preorder
]
[单选题]
To obtain a prefix expression, which of the following traversals is used?
选项:[ Level order, Postorder
, Inorder
, Preorder
]
[单选题]
The maximum number of nodes in a tree for which postorder and preorder traversals may be equal to is _______ .
选项:[3, 0, 2, 1]
[单选题]
Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty
Binary Search Tree. The Binary Search Tree uses the usual ordering on natural numbers. What is the inorder traversal sequence of the resultant tree?
选项:[ 7 5 1 0 3 2 4 6 8 9, 0 1 2 3 4 5 6 7 8 9
, 9 8 6 4 2 3 0 1 5 7
, 0 2 4 3 1 6 5 9 8 7
]
[单选题]A full binary tree is a tree where________________.
选项:[all the leaves are at the same level.
, each node has exactly two children, each node has exactly zero or two children.
, each node has exactly one or two children.
]
[单选题]A complete binary tree is a tree where________________. 选项:[every level of the tree is completely filled except the last level
, each node has exactly one or two children
, each node has exactly zero or two children
, each node has exactly two children]
温馨提示支付 ￥1.00 元后可查看付费内容,请先翻页预览!
