Skip to content

README.md

Latest commit

 

History

History
28 lines (21 loc) · 1.18 KB

README.md

File metadata and controls

28 lines (21 loc) · 1.18 KB
Raw

Binary Digital Tree

Java implementation of a binary digital tree built from records containing strings and binary codes.

Highlights

  • Reads fixed-size records from a binary file.
  • Builds a tree by following 0 and 1 paths.
  • Supports tree compaction logic.
  • Includes a decoding method based on binary sequences.
  • Uses RandomAccessFile for record-based file access.

This implementation currently does not include a Main.java demo. The source compiles as a reusable structure and can be exercised by creating records with Registro and loading them through Arquivo.

Files

  • Arvore.java: binary digital tree logic.
  • No.java: tree node.
  • Registro.java: fixed-size record with text and binary code.
  • Arquivo.java: file abstraction using RandomAccessFile.
  • Pilha.java and NoPilha.java: custom stack used by traversal/compaction routines.