Tagged Questions

1
vote
1answer
61 views

Binary Search Feedback

I have written a binary search algorithm, but it seems to be a bit different than other peoples that I've seen. I was hoping that the community could give me some feedback as to whether or not I'm ...
1
vote
2answers
99 views

Check if a Binary Tree <String> is aBinary Search Tree

i'm understanding the question but wanna make sure if my implementation is correct or not =| The Q is : Write a method that accepts as its argument a BinaryTree object and returns true if the ...
0
votes
1answer
62 views

Creating an Array of Linked Lists from a BST

Question Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (eg, if you have a tree with depth D, you’ll have D linked lists) Here is my ...
1
vote
2answers
113 views

How can this code become cleaner and less error prone? Especially the binary search part

How could this code become cleaner? I think that the way I handle the interfaces and binary search could be improved. I am trying to understand how to structure such a code 9and usage of APIs) in a ...
2
votes
1answer
225 views

Returning Binary Search Tree Nodes in Zig Zag manner

I tried to implement an answer for the algorithm question given below. I implemented two different solutions. I couldn't decide which one is better. ( Maybe none ) Note: Node class and ZigZag ...
1
vote
2answers
7k views

Deleting a node from Binary Search Tree

I have read about it at few places and tried to write my own version, would like to get it reviewed. class Node { private int value; private Node left; private Node right // ...
2
votes
2answers
2k views

Splay tree implementation

I am looking into splay trees and I implemented a version. It seems correct. Could someone please let me know if this indeed correct and how to improve it? I will just show the insert item and splay. ...
5
votes
3answers
589 views

Java binary search (and get index if not there) review

I want to do binary search and if the target is not there get the index of where it should have been. This is the code I came up with. It seems correct. Is there any problem? Can it be improved? ...