flo-ll-rb-tree
Version:
A simple left leaning red black tree implementation.
20 lines (18 loc) • 559 B
text/typescript
/*
import { describe } from 'mocha';
import { expect } from 'chai';
import { insert1to7 } from './helpers/insert-1-to-7.js';
import { LlRbTree } from '../src/index.js';
import { compare } from './helpers/compare.js';
describe('findAllInOrder', function() {
it('it should return the ordered data at the tree nodes',
function() {
{
const tree = new LlRbTree(compare);
insert1to7(tree);
const r = tree.findAllInOrder(6)[0].datum;//?
expect().to.eql([3]);
}
});
});
*/