TreeNode left; TreeNode right; TreeNode parent; //optional } You have to implement the given functions in Binary search Tree class. 2. Binary Search Trees (BST) You are required to implement a Binary Search Tree (BST) ADT (Abstract Data Type). Following functionalities are expected. 2.1 Constructor Creates an empty Binary Search Tree. 2.3 Inserts a new node in BST (Standard Inser
in java
you have to implement some basic methods for BST's (with a little twist). Each node
in the tree has a data element (an integer) and links (possibly null) to its left and right children (you
can also include parent but not compulsory).
1. Sample TreeNode
class TreeNode
{
int key;
TreeNode left;
TreeNode right;
TreeNode parent; //optional
}
You have to implement the given functions in Binary search Tree class.
2. Binary Search Trees (BST)
You are required to implement a Binary Search Tree (BST) ADT (Abstract Data Type). Following
functionalities are expected.
2.1 Constructor
Creates an empty Binary Search Tree.
2.3 Inserts a new node in BST (Standard Insert)
Inserts a new node in BST.
2.4 Delete
Deletes a node from a BST (Standard Delete)
2.5 Lookup
Find a value in the tree, lookup is a fancy name of find function
2.6 Size
Returns the total number of nodes in a BST
2.7 MaxDepth
Returns the depth of the longest path in a Binary Search Tree.
Trending now
This is a popular solution!
Step by step
Solved in 8 steps
