-
Notifications
You must be signed in to change notification settings - Fork 641
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
48 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,48 @@ | ||
package com.coding.basic.tree; | ||
|
||
import java.util.ArrayList; | ||
import java.util.List; | ||
|
||
import com.coding.basic.queue.Queue; | ||
|
||
public class BinarySearchTree<T extends Comparable> { | ||
|
||
BinaryTreeNode<T> root; | ||
public BinarySearchTree(BinaryTreeNode<T> root){ | ||
this.root = root; | ||
} | ||
public BinaryTreeNode<T> getRoot(){ | ||
return root; | ||
} | ||
public T findMin(){ | ||
return null; | ||
} | ||
public T findMax(){ | ||
return null; | ||
} | ||
public int height() { | ||
return -1; | ||
} | ||
public int size() { | ||
return -1; | ||
} | ||
public void remove(T e){ | ||
|
||
} | ||
public List<T> levelVisit(){ | ||
|
||
return null; | ||
} | ||
public boolean isValid(){ | ||
return false; | ||
} | ||
public T getLowestCommonAncestor(T n1, T n2){ | ||
return null; | ||
|
||
} | ||
public List<T> getNodesBetween(T n1, T n2){ | ||
return null; | ||
} | ||
|
||
} | ||
|