The problem lies in your base case. “The height of a tree is the length of the path from the root to the deepest node in the tree. A (rooted) tree with only a node (the root) has a height of zero.” – Wikipedia If there is no node, you want to return -1 not … Read more
The general way depends on whether you have a parent link in your nodes or not. If you store the parent link Then you pick: The leftmost child of the right child, if your current node has a right child. If the right child has no left child, the right child is your inorder successor. … Read more
How to fix remove in RedBlackTree implementation?
Here is a quick example of a binary insert: class Node: def __init__(self, val): self.l_child = None self.r_child = None self.data = val def binary_insert(root, node): if root is None: root = node else: if root.data > node.data: if root.l_child is None: root.l_child = node else: binary_insert(root.l_child, node) else: if root.r_child is None: root.r_child = … Read more
Binary tree: Tree where each node has up to two leaves 1 / \ 2 3 Binary search tree: Used for searching. A binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes with values greater than or equal to the … Read more
In MySearchTree the K of the base type is Course. So K must “extend” Comparable<Keyable<Course>> & Keyable<Course>. But it doesn’t, it extends Comparable<Keyable<DataElement>> & Keyable<DataElement>. I guess DataElement should be generified in a similar manner to Comparable or Enum. public interface Keyable <T> {public String getKey();} public interface DataElement<THIS extends DataElement<THIS>> extends Comparable<Keyable<THIS>>, Keyable<THIS>, Serializable … Read more
One advantage that no one else has pointed out is that binary search tree allows you to do range searches efficiently. In order to illustrate my idea, I want to make an extreme case. Say you want to get all the elements whose keys are between 0 to 5000. And actually there is only one … Read more
As Jimmy points out you can use timezone transitions, but this is not available on PHP <5.3. as dateTimeZone() is PHP>=5.2.2 but getTransitions() with arguments is not! In that case here is a function that can give you timezone data, including whether in DST or not. function timezonez($timezone=”Europe/London”){ $tz = new DateTimeZone($timezone); $transitions = $tz->getTransitions(); … Read more
Actually that is the mistake everybody does in an interview. Leftchild must be checked against (minLimitof node,node.value) Rightchild must be checked against (node.value,MaxLimit of node) IsValidBST(root,-infinity,infinity); bool IsValidBST(BinaryNode node, int MIN, int MAX) { if(node == null) return true; if(node.element > MIN && node.element < MAX && IsValidBST(node.left,MIN,node.element) && IsValidBST(node.right,node.element,MAX)) return true; else return false; … Read more
The simplest solution for this is maintaining a min heap of max size 5000. Every time a new number arrives – check if the heap is smaller then 5000, if it is – add it. If it is not – check if the minimum is smaller then the new element, and if it is, pop … Read more