legendarius116 / compressiblebst Goto Github PK
View Code? Open in Web Editor NEWAssignment 6 of Data Structures, where I had to build a binary search tree. In its delete function, it released leaf nodes back into the heap, while marking nodes with children as inactive. The compress() function releases the internal nodes and rebuilds the tree accordingly.