added Description

Author: mauricechouam

Add Two Numbers/code.js

@@ -321,11 +321,8 @@ Output: 3
 Explanation: The LCA of nodes 5 and 1 is 3.
 
 ## 32) [Lowest Common Ancestor of a Binary Tree](https://github.com/mauricechouam/Leetcode-training/blob/main/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/code.js)
-Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
-According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
-Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
-Output: 3
-Explanation: The LCA of nodes 5 and 1 is 3.
+You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
+\You may assume the two numbers do not contain any leading zero, except the number 0 itself.