# Trees and Graphs

- [Directory Sum](/interview-practice-problems/leetcode_sessions/trees-and-graphs/directory_sum.md)
- [Largest Subtree](/interview-practice-problems/leetcode_sessions/trees-and-graphs/largest-subtree.md)
- [Shortest Path DAG Source to Sink](/interview-practice-problems/leetcode_sessions/trees-and-graphs/lowest-cost-path-in-graph-from-a-to-b.md)
- [HTML Parser](/interview-practice-problems/leetcode_sessions/trees-and-graphs/html-parser.md)
- [Infix to Postfix Expression Evaluater](/interview-practice-problems/leetcode_sessions/trees-and-graphs/infix-to-postfix-expression-evaluater.md)
- [Longest Path in Undirected Acyclic Graph](/interview-practice-problems/leetcode_sessions/trees-and-graphs/longest-path-in-undirected-acyclic-graph.md)
- [Decompress String](/interview-practice-problems/leetcode_sessions/trees-and-graphs/uncompress-string.md)
- [Pythagoras Tree](/interview-practice-problems/leetcode_sessions/trees-and-graphs/pythagoras-tree.md)
- [Kings](/interview-practice-problems/leetcode_sessions/trees-and-graphs/kings.md)
- [All Paths](/interview-practice-problems/leetcode_sessions/trees-and-graphs/all_paths.md)
- [Leaf Nodes](/interview-practice-problems/leetcode_sessions/trees-and-graphs/leaf-nodes.md)
- [Proper Locking](/interview-practice-problems/leetcode_sessions/trees-and-graphs/proper-locking.md)
- [Number of Cities at each Distance](/interview-practice-problems/leetcode_sessions/trees-and-graphs/number-of-cities-at-each-distance.md)
- [Root Path as DLL](/interview-practice-problems/leetcode_sessions/trees-and-graphs/root-path-as-dll.md)
- [Binary Replacement](/interview-practice-problems/leetcode_sessions/trees-and-graphs/binary-replacement.md)
- [All Root to Leaf Paths](/interview-practice-problems/leetcode_sessions/trees-and-graphs/all_root_to_leaf_paths.md)