rope's(chord's) data structure class **************************WARNING***************************** This is a class under current development, this implementation doesn't comply with the implementations that you might've seen online. Please read the code carefully if you plan to use this class More...

#include <rope.h>

Public Member Functions
	rope (std::string s, int64_t splits=2)

void	create (std::string s, int64_t splits=2)

std::string	inorder ()

int64_t	height ()

Detailed Description

rope's(chord's) data structure class **************************WARNING***************************** This is a class under current development, this implementation doesn't comply with the implementations that you might've seen online. Please read the code carefully if you plan to use this class

This class needs a lot of optimizations, like the way it performs splitting. Splitting right now keeps BFS'ing on all the nodes, but we always know that only the leaf nodes will split. Also, at insertion we have to search for already existing subtrees and point the new node there instead of creating duplicates.

The documentation for this class was generated from the following file:

/Users/runner/work/AlgoPlus/AlgoPlus/src/classes/tree/rope.h

Public Member Functions

Detailed Description