-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
56 lines (50 loc) · 995 Bytes
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
using System;
using System.Collections.Generic;
namespace ConvertBinarySearchTree
{
public class Node
{
public int val;
public Node left;
public Node right;
public Node() { }
public Node(int _val)
{
val = _val;
left = null;
right = null;
}
public Node(int _val, Node _left, Node _right)
{
val = _val;
left = _left;
right = _right;
}
}
class Program
{
static void Main(string[] args)
{
Console.WriteLine("Hello World!");
}
public static Node TreeToDoublyList(Node root)
{
if (root == null) return null;
var nodes = new List<Node>();
DFS(root, nodes);
for (int i = 0; i < nodes.Count; i++)
{
nodes[i].left = i == 0 ? nodes[^1] : nodes[i - 1];
nodes[i].right = i == nodes.Count - 1 ? nodes[0] : nodes[i + 1];
}
return nodes[0];
}
public static void DFS(Node node, List<Node> nodes)
{
if (node == null) return;
DFS(node.left, nodes);
nodes.Add(node);
DFS(node.right, nodes);
}
}
}