Answered: Assume we already have class for binary…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Assume we already have class for binary search tree called BinarySearchT,

you have access to the following methods (assume they are coded)

public class BSTNode<E> { public int key; public E value; public BSTNode left; public BSTNode right; } public class BinarySearchT<E> { private BSTNode root; public void insert(int key, E value) { ... } public void delete(int key) { ... } public <E> find(int key) { ... } }

you are asked to only code a method public int treeH() to the BinarySearchT class that computes the height of the tree.

Hint: You can use a helper method.

Hints:

you should use a helper function
I would do it with recursion
the key and value has no effect on this
remember what is the definition of the height with respect the depths of nodes
you can use Math.max(a,b) that would return the max between a and b, but if you prefer, you also can do it with loops

Note: make sure the name of the method matches

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions