Binary search tree is constructed by repeatedly, C/C++ Programming

Assume that a Binary Search Tree is constructed by repeatedly inserting exact values in to the tree. Argue that the number of nodes examined in searching for a value in the tree is one + the number of nodes determined when the value was first inserted in to the tree

Let us take an element x to insert in a binary search tree. So for inserting the 

 

1634_11.png

 

element x first at level 0,then level 1 and assume upto level (d-1). While determine at (d-1) level, x may have less or more in comparison to element at (d-1). The we enter x either left or right. In both cases no of determined code will be d. Now Assume we require to search for x, this time again traverses the similar path as we traverse. Whereas inserting the element, we stop at (d-1) the level but for searching we determine node at dth level also i.e. the node  having x. Thus number of node determine while inserting are d while     incase  of searching it is d+1 i.e. one more than whereas inserting, as the result.

 

 

Posted Date: 5/3/2013 3:40:58 AM | Location : United States







Related Discussions:- Binary search tree is constructed by repeatedly, Assignment Help, Ask Question on Binary search tree is constructed by repeatedly, Get Answer, Expert's Help, Binary search tree is constructed by repeatedly Discussions

Write discussion on Binary search tree is constructed by repeatedly
Your posts are moderated
Related Questions
convert BST into sorted doubly linked list

A: The procedure of encoding the parameter types along with the function/method name into a unique name is called as name mangling. The inverse procedure is called demangling. F

How do I allocate multidimensional arrays by new? A: There are several ways to do this, based on how flexible you wish the array sizing to be. On one acute, if you know all the


volume of a sphere

Write a ''C'' program to accept any 3 digit integer number from the keyboard and display the word equivalent representation of the given number

How can I handle a destructor that fails? Need help please provide example also.

i want software to calculate heating or use thermodynamic equation , pleas help me


explain the function of five elements that are found on a motherboard#