当前位置：首页
> Luz 第6668页
Luz 管理员
暂无介绍
89859 篇文章 33 次评论An AVL tree with the balance factors of all the non-leaf nodes b
An AVL tree with the balance factors of all the non-leaf nodes being 0 must be a perfect binary tree. ~@[](2)答案：TRUE…
For a binomial queue, merging takes a constant time on average.
For a binomial queue, merging takes a constant time on average. ~@[](1)答案：FALSE…
For a binomial queue, delete-min takes a constant time on averag
For a binomial queue, delete-min takes a constant time on average. ~@[](1)答案：FALSE…
If a complete binary tree with 136 nodes is stored in an array (
If a complete binary tree with 136 nodes is stored in an array (root at position 1), then the node at position 12 prece…
If a complete binary tree with 137 nodes is stored in an array (
If a complete binary tree with 137 nodes is stored in an array (root at position 1), then the nodes at positions 128 and…
For a forest with $$N$$ nodes and $$K$$ edges, we cannot determi
For a forest with $$N$$ nodes and $$K$$ edges, we cannot determine its total number of trees. ~@[](2)答案：FALSE…
If `X` and `Y` are both leaf nodes in a binary tree, then there
If `X` and `Y` are both leaf nodes in a binary tree, then there exists a binary tree with preorder traversal sequence ..…
Store a complete binary tree in an array (root at position 1).
Store a complete binary tree in an array (root at position 1). Then the nodes at positions 23 and 24 are siblings. ~@[]…
For any node in an AVL tree, the height of the left subtree must
For any node in an AVL tree, the height of the left subtree must be greater than that of the right subtree. ~@[](1)答案：FA…
If a complete binary tree with 111 nodes is stored in an array (
If a complete binary tree with 111 nodes is stored in an array (root at position 1), then the node at position 13 prece…