Overview This project reads a tree structure from a text file, processes the data to rebuild the tree, identifies special nodes based on specific conditions, and writes the results to an output file.

This project is a JavaFX application for visualizing an AVL (Adelson-Velsky and Landis) tree. An AVL tree is a self-balancing binary search tree. The application provides a user interface to insert, ...

Given a Binary Search Tree (BST), find the Lowest Common Ancestor (LCA) of two given nodes, p and q, in the tree. The Lowest Common Ancestor is the lowest node in the tree that has both p and q as ...

Given the roots of two binary trees, root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of root is a tree ...