1.The binary search tree provides us with a structure that allows us O( __ ) acc
ID: 3673572 • Letter: 1
Question
1.The binary search tree provides us with a structure that allows us O( __ ) access to any node in the structure - an improvement over the sequential search of a(n)___(list which is O(n).)
2.A binary tree is a structure in which each node is capable of having___successor nodes, called___. The unique starting node is called the___.
3.A__node is one that has no children. A node of a binary tree is itself the root of a smaller tree called a___. All nodes appearing in a subtree are called___of the root node of the tree - conversely, the root node is called an___of all nodes appearing below it. The root node of a tree is said to have level___ . The maximum level in a tree determines its___and the level contains at most nodes.
4.In a binary search tree, what is true of all nodes in the right subtree of some given node?
5. If you want to get ride of an existing tree, the statement tree = NULL is not recommended. Why?
6.Any node inserted in a binary search tree necessarily comes a___node.
7.Is the recursive function Find on page 410 a good use of recursion? Why or why not?
8.Minimizing the height of a Binary Search Tree will maximize
9.What three cases are considered in developing the Remove function?
10.Name the three BST traversals.
Explanation / Answer
1.The binary search tree provides us with a structure that allows us O( log2N__ ) access to any node in the structure - an improvement over the sequential search of a(n)___(list which is O(n).)
2) 2.A binary tree is a structure in which each node is capable of having_two_successor nodes, called_children__. The unique starting node is called the_root__
3.A_leaf_node is one that has no children. A node of a binary tree is itself the root of a smaller tree called a_Parent__. All nodes appearing in a subtree are called_child__of the root node of the tree - conversely, the root node is called an Parent___of all nodes appearing below it. The root node of a tree is said to have level_0__ . The maximum level in a tree determines its_height__and the level contains at most nodes.
5. If you want to get ride of an existing tree, the statement tree = NULL is not recommended. Why?
Because if we true = NULL, Then its not became null, its an empty tree with no node.
10.Name the three BST traversals.
Preorder, Inorder, PostOrder
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.