Pretty Print a Binary Tree in Python
Visualizing a binary tree can help in understanding its structure and the relationships between its nodes. It is particularly useful for debugging problems with complex Binary Trees.
Tag: Tree
Finding the Diameter of a Binary Tree – LeetCode Solution [Easy]
The diameter of a binary tree is the length of the longest path between any two nodes
BFS (Breadth-First Search) in Binary Trees and Graphs
BFS (Breadth-First Search) is one of the simplest algorithms for traversing a graph. Prim’s min-spanning-tree and Djikstra’s algorithm use similar ideas as BFS. BFS is also known as Level-order traversal because the algorithm discover all nodes at distance k from root before discovering any nodes at distance k+1.