1
+ import scala .annotation .tailrec
2
+
3
+ class TreeNode (_value : Int = 0 , _left : TreeNode = null , _right : TreeNode = null ) {
4
+ var value : Int = _value
5
+ var left : TreeNode = _left
6
+ var right : TreeNode = _right
7
+ }
8
+
9
+ object Solution {
10
+ import scala .collection .mutable
11
+ def print (root : TreeNode ): Unit = {
12
+ val array = mutable.ArrayBuffer .empty[mutable.ArrayBuffer [Int ]]
13
+ def bfs (node : TreeNode , level : Int ): Unit = {
14
+ if (node != null ) {
15
+ if (array.size <= level) {
16
+ array.addOne(mutable.ArrayBuffer .empty)
17
+ }
18
+ array(level).addOne(node.value)
19
+ bfs(node.left, level + 1 )
20
+ bfs(node.right, level + 1 )
21
+ }
22
+ }
23
+ bfs(root, 0 )
24
+ array.foreach(println)
25
+ }
26
+
27
+
28
+ def deleteNode (root : TreeNode , key : Int ): TreeNode = {
29
+
30
+ }
31
+ }
32
+
33
+ val tree1 = new TreeNode (5 ,
34
+ _left = new TreeNode (3 ,
35
+ _left = new TreeNode (2 ),
36
+ _right = new TreeNode (4 ),
37
+ ),
38
+ _right = new TreeNode (6 ,
39
+ _right = new TreeNode (7 )
40
+ ),
41
+ )
42
+
43
+ Solution .print(tree1)
44
+ val subTree = Solution .deleteNode(tree1, 3 )
45
+ Solution .print(subTree)
0 commit comments