https://github.com/rishabh3112/binary-trees
Code to basic binary tree problems follow along 😃🎉
https://github.com/rishabh3112/binary-trees
binary-tree data-structures iteration java recursion
Last synced: about 1 year ago
JSON representation
Code to basic binary tree problems follow along 😃🎉
- Host: GitHub
- URL: https://github.com/rishabh3112/binary-trees
- Owner: rishabh3112
- License: mit
- Created: 2018-07-03T17:20:18.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2018-10-06T03:21:05.000Z (over 7 years ago)
- Last Synced: 2025-01-30T20:49:13.942Z (about 1 year ago)
- Topics: binary-tree, data-structures, iteration, java, recursion
- Language: Java
- Homepage:
- Size: 16.6 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
&
# Binary Trees
***Project is now on hold, will be continued soon***
## **Node structure**
```
BTNode
-> data
-> left
-> right
```
## **Helper Strategies Implemented**
1. depthFirstInput
2. levelOrderInput
3. depthFirstPrint
4. levelOrderPrint
## **Problem Function**
1. Find Node [`#1`](https://github.com/rishabh3112/binary-trees/issues/1)
2. Height of tree [`#2`](https://github.com/rishabh3112/binary-trees/issues/2)
3. Mirror of tree [`#3`](https://github.com/rishabh3112/binary-trees/issues/3)
4. Diameter of tree without pair [`#6`](https://github.com/rishabh3112/binary-trees/issues/6)
5. Diameter and height of tree with pair [`#7`](https://github.com/rishabh3112/binary-trees/issues/7)
6. In-order traversal [`#8`](https://github.com/rishabh3112/binary-trees/issues/8)
7. Pre-order traversal [`#4`](https://github.com/rishabh3112/binary-trees/issues/4)
8. Post-order traversal [`#5`](https://github.com/rishabh3112/binary-trees/issues/5)
9. Construct Tree From InOrder and preOrder arrays [`#10`](https://github.com/rishabh3112/binary-trees/issues/10)
10. Construct Tree From InOrder and postOrder arrays [`#11`](https://github.com/rishabh3112/binary-trees/issues/11)
11. Sum of all nodes [`#12`](https://github.com/rishabh3112/binary-trees/issues/12)
12. is Balanced [`#13`](https://github.com/rishabh3112/binary-trees/issues/13)
13. Print each level [`#14`](https://github.com/rishabh3112/binary-trees/issues/14)
14. Remove Leaf Nodes [`#15`](https://github.com/rishabh3112/binary-trees/issues/15)
15. Level wise linked list [`#16`](https://github.com/rishabh3112/binary-trees/issues/16)
16. Print ZigZag [`#17`](https://github.com/rishabh3112/binary-trees/issues/17)
#### Contribute
1. Add new problems as issues 😍
2. Submit a pull request with description 😎