The location of a node in a binary search tree is defined as a string such as LLRRL, which represents the node that you find by starting at the root, and traversing Left, traverse Left, traverse Right, traverse Right, and traverse Left.   Write a function to print a path to some target 'x' based on the direction from the root to the target.  For example, in the tree above, the path from 65 to 52 is LRR. Hint: use a stack to store the path.

Write a recursive algorithm to count the number of right children in a binary search tree.

Write the method levelCount whose header is given below. Method levelCount returns the number of nodes on the specified level.

Posted Date: 4/2/2013 1:23:31 AM | Location : United States

Ask an Expert

Related Discussions:- Recursive function, Assignment Help, Ask Question on Recursive function, Get Answer, Expert's Help, Recursive function Discussions

Write discussion on Recursive function
Your posts are moderated

Write your message here..

Related Questions

Compound interest, Write the algorithm for compound interest Write the algorithm for compound interest

Terminology used for files structures, Given are the definitions of some im... Given are the definitions of some important terms: 1) Field: This is an elementary data item characterized by its size, length and type. For instance, Name

Algorithams example, any simple algoritham questions with answers any simple algoritham questions with answers

Discuss the brute force algorithm, Question 1 What do you mean by Amortiza... Question 1 What do you mean by Amortization? Question 2 Explain the following Big Oh notation (O) Omega notation (Ω) Theta notation (Θ)   Question 3 Di

Explain the concept of colouring, Colouring The use of colours in CAD/C... Colouring The use of colours in CAD/CAM has two main objectives : facilitate creating geometry and display images. Colours can be used in geometric construction. In this case,

Explain division method, Explain Division Method Division Method: - In... Explain Division Method Division Method: - In this method, key K to be mapped into single of the m states in the hash table is divided by m and the remainder of this division

Indexed sequential files, Indexed Sequential Files An index is inserted... Indexed Sequential Files An index is inserted to the sequential file to provide random access. An overflow area required to be maintained to permit insertion in sequence. I

Boundary tag system., boundary tag system in data structure? boundary tag system in data structure?

Red-black tree after insertion, The above 3 cases are also considered conve... The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Applications of avl trees, AVL trees are applied into the given situations:... AVL trees are applied into the given situations: There are few insertion & deletion operations Short search time is required Input data is sorted or nearly sorted