# 1. The binary search tree provides us with a structure that allows us O( __ ) access to any node...

## 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.Anode 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 rid 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.

## Binary tree:

In the binary tree, every node has at most 0,1,2 child. The tree contains a node liked linked list to store the data and linked with another node.

A binary tree has a limitation: The left node has always a smaller value then parent, the right node has a grater value the parent node.

1. The binary search tree provides us with a structure that allows us O( log n ) 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 two successor nodes, called a child. 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_subtree. All nodes appearing in a subtree are called_linked nodesof the root node of the tree - conversely, the root node is called a_parentof 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_heightsand the level contains at most nodes.

4. It's a rule that: The right subtree has a node value grater then root node value.

5. The statement tree has node values and subtrees.

6. Any node inserted in a binary search tree necessarily comes a_ leafnode.

7. A recursive function is good to use for the programmer because the recursive function calls itself until the function completes .by using this we reduce the same coding again and again and saves time.

8. Minimizing the height of a Binary Search Tree will maximize subtrees.

9. a.Deletion at zero child b. Deletion at one child c. Deletion at 2 children

10. Inorder, Postorder, Preorder Traversal.