Tree Algorithm in LeetCode

Id	Title	Solution	Time	Runtime	Space	Difficulty	Catagory
0087	Scramble String	Java	-	-	-	Hard	Tree
0100	Same Tree	Java	-	-	-	Easy	Tree
0101	Symmetric Tree	Java	-	-	-	Easy	Tree
0105	Construct Binary Tree from Preorder and Inorder Traversal	Java	O(n)	99.24%	O(n)	Medium	Tree
0144	Binary Tree Preorder Traversal	Java	-	-	-	Medium	Tree
0173	Binary Search Tree Iterator	Java	-	-	-	Medium	Tree
0208	Implement Trie (Prefix Tree)	C	O(n)	39ms	O(n)	Medium	Tree
0211	Add and Search Word - Data structure design	Java	-	-	-	Medium	Tree
0220	Contains Duplicate III	Java	-	-	-	Medium	Tree
0222	Count Complete Tree Nodes	Java	-	-	-	Medium	Tree
0226	Invert Binary Tree	Java	O(n)	0MS	O(1)	Easy	Tree
0230	Kth Smallest Element in a BST	Java	-	-	-	Medium	Tree
0235	Lowest Common Ancestor of a Binary Search Tree	Java	-	-	-	Easy	Tree
0236	Lowest Common Ancestor of a Binary Tree	Java	-	-	-	Medium	Tree
0257	Binary Tree Paths	Java	-	-	-	Easy	Tree
0307	Range Sum Query - Mutable	Java	O(n*logn)	-	O(n)	Medium	Tree
0315	Count of Smaller Numbers After Self	C	O(n*logn)	16ms	O(n)	Hard	Tree
0336	Palindrome Pairs	Java	O(n*lgm)	52ms	O(n*m)	Hard	Tree
0404	Sum of Left Leaves	Java	-	-	-	Easy	Tree
0449	Serialize and Deserialize BST	Java	-	-	-	Medium	Tree
0450	Delete Node in a BST	Java	-	-	-	Medium	Tree
0493	Reverse Pairs	Java	-	-	-	Hard	Tree
0501	Find Mode in Binary Search Tree	Java	-	-	-	Easy	Tree
0508	Most Frequent Subtree Sum	Java	-	-	-	Medium	Tree
0515	Find Largest Value in Each Tree Row	Java	-	-	-	Medium	Tree
0538	Convert BST to Greater Tree	Java	-	-	-	Easy	Tree
0563	Binary Tree Tilt	Java	-	9MS	O(n)	Easy	Tree
0572	Subtree of Another Tree	Java	-	-	-	Easy	Tree