├── README.md ├── avl-del2.zip ├── avl-tree2.zip ├── binary-tree-traversal2.zip ├── binary-tree.zip ├── bst2.zip ├── bstdele2.zip ├── full-binary-tree-2.zip ├── full-binary-tree-traversal.zip ├── is-balanced-binary-tree.zip ├── is-complete-binary-tree-2.zip ├── is-list-balanced.zip ├── is-p_b_tree.zip ├── is-skewed-binary-tree.zip ├── p_btree2.zip └── tree.zip /README.md: -------------------------------------------------------------------------------- 1 | # Tree-Data_Structures 2 | 3 | Trees are hierarchical data structures that consist of nodes connected by edges. 4 | 5 | In this repository, we provide implementations of two types of trees: 6 | 7 | Binary Search Tree (BST): A binary tree in which each node has at most two children, and the left child contains a value less than the parent node, while the right child contains a value greater than the parent node. 8 | 9 | Binary Tree (BT): A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. 10 | -------------------------------------------------------------------------------- /avl-del2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/avl-del2.zip -------------------------------------------------------------------------------- /avl-tree2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/avl-tree2.zip -------------------------------------------------------------------------------- /binary-tree-traversal2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/binary-tree-traversal2.zip -------------------------------------------------------------------------------- /binary-tree.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/binary-tree.zip -------------------------------------------------------------------------------- /bst2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/bst2.zip -------------------------------------------------------------------------------- /bstdele2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/bstdele2.zip -------------------------------------------------------------------------------- /full-binary-tree-2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/full-binary-tree-2.zip -------------------------------------------------------------------------------- /full-binary-tree-traversal.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/full-binary-tree-traversal.zip -------------------------------------------------------------------------------- /is-balanced-binary-tree.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/is-balanced-binary-tree.zip -------------------------------------------------------------------------------- /is-complete-binary-tree-2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/is-complete-binary-tree-2.zip -------------------------------------------------------------------------------- /is-list-balanced.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/is-list-balanced.zip -------------------------------------------------------------------------------- /is-p_b_tree.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/is-p_b_tree.zip -------------------------------------------------------------------------------- /is-skewed-binary-tree.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/is-skewed-binary-tree.zip -------------------------------------------------------------------------------- /p_btree2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/p_btree2.zip -------------------------------------------------------------------------------- /tree.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/DharshiniB04/Tree-Data_Structures/3b4b344ff8e3562edd8bde4a57f07e87b9aa995c/tree.zip --------------------------------------------------------------------------------