Bill Jacobs
5e23bd9c81
Changed SubArrayMinTest to use Integer.bitCount
...
This changes SubArrayMinTest to use the library method Integer.bitCount rather than a hand-rolled bit counting implementation.
2016-06-24 14:46:37 -07:00
Bill Jacobs
91b5ae633a
Fixed SubArrayMin to check children
...
This fixes SubArrayMin to check the appropriate children of the endpoint nodes, in addition to the children of their ancestors.
2016-06-17 21:54:19 -07:00
Bill Jacobs
8c98d5cc42
Changed createTree to set root's parent to null
...
This changes createTree to set the "parent" field of the root node to null.
2016-06-06 14:55:58 -07:00
Bill Jacobs
cd4424b94a
Fixed calls to augment() in fixSiblingDeletion()
...
This fixes fixSiblingDeletion() to call augment() in certain cases where augment() returns false.
2016-06-02 20:40:35 -07:00
Bill Jacobs
deb397ed1e
Changed fixInsertion to always augment parent
...
This changes fixInsertion to always augment the node's parent, even if the initial call to augment() returns false, assuming "augment" is true. When we insert a node, we are supposed to ignore its initial state; thus, we ignore the return value of augment().
2016-05-31 23:07:52 -07:00
Bill Jacobs
dd0fd1959c
Clear links after removing node
...
This changes the remove methods to set the parent and child links to be null, so that we're more likely to encounter an exception if we attempt to access the node.
2016-05-28 10:56:08 -07:00
Bill Jacobs
a1dba8a58c
Added test for "lca"
...
This adds SubArrayMinTest, which tests RedBlackNode.lca.
2016-05-26 14:47:27 -07:00
Bill Jacobs
f355e1ed2b
Added LCA
...
This adds a RedBlackNode method for computing the lowest common ancestor of two nodes.
2016-05-26 12:22:32 -07:00
Bill Jacobs
82c1fbdc7b
Made fixInsertion return the new root
...
This changes RedBlackNode.fixInsertion to return the root of the resulting tree.
2016-05-26 10:37:25 -07:00
Bill Jacobs
389f8ea4e2
Initial commit
...
This adds the initial contents of the repository.
2016-05-23 13:51:21 -07:00
