树

LeetCode notes on implementing a Trie prefix tree.

LeetCode notes on counting unique binary search trees with DFS, memoization, and dynamic programming.

LeetCode notes on binary tree inorder traversal with recursion and color marking.

LeetCode notes on reconstructing a binary tree from preorder and inorder traversals.

Notes on implementing preorder, inorder, and postorder traversal of a binary tree.

LeetCode notes on converting a binary search tree to a Greater Sum Tree.

LeetCode notes on validating a binary search tree with inorder traversal.

LeetCode notes on flattening a binary tree into a linked list in preorder.

LeetCode notes on finding the lowest common ancestor in a binary tree.

LeetCode notes on calculating the diameter of a binary tree.

Notes on finding the lowest common ancestor of two nodes in a binary tree.

LeetCode notes on merging two binary trees.

LeetCode notes on checking whether a binary tree is mirror-symmetric.

LeetCode notes on House Robber III using DFS and memoization.

LeetCode notes on summing all numbers formed by root-to-leaf paths.

LeetCode notes on Invert Binary Tree.

LeetCode notes on Path Sum III.

LeetCode notes on Maximum Depth of Binary Tree.

LeetCode notes on Binary Tree Maximum Path Sum.

LeetCode notes on Binary Tree Right Side View.

LeetCode notes on Binary Tree Level Order Traversal.

LeetCode notes on Serialize and Deserialize Binary Tree.

LeetCode notes on Binary Tree Zigzag Level Order Traversal.