File tree 1 file changed +40
-0
lines changed
1 file changed +40
-0
lines changed Original file line number Diff line number Diff line change
1
+ /**
2
+ * Definition for a binary tree node.
3
+ * function TreeNode(val, left, right) {
4
+ * this.val = (val===undefined ? 0 : val)
5
+ * this.left = (left===undefined ? null : left)
6
+ * this.right = (right===undefined ? null : right)
7
+ * }
8
+ */
9
+ /**
10
+ * DFS | Preorder Traversal
11
+ * Time O(n) | Space O(n)
12
+ * https://leetcode.com/problems/leaf-similar-trees/
13
+ * @param {TreeNode } root1
14
+ * @param {TreeNode } root2
15
+ * @return {boolean }
16
+ */
17
+ var leafSimilar = function ( root1 , root2 ) {
18
+
19
+ const dfs = ( node , arr ) => {
20
+ if ( ! node . left && ! node . right ) {
21
+ arr . push ( node . val ) ;
22
+ return arr ;
23
+ }
24
+ if ( node . left ) dfs ( node . left , arr ) ;
25
+ if ( node . right ) dfs ( node . right , arr ) ;
26
+
27
+ return arr ;
28
+ }
29
+
30
+ const arr1 = dfs ( root1 , [ ] ) ;
31
+ const arr2 = dfs ( root2 , [ ] ) ;
32
+
33
+ if ( arr1 . length !== arr2 . length ) return false ;
34
+
35
+ for ( let i = 0 ; i < arr1 . length ; i ++ ) {
36
+ if ( arr1 [ i ] !== arr2 [ i ] ) return false ;
37
+ }
38
+
39
+ return true ;
40
+ } ;
You can’t perform that action at this time.
0 commit comments