github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update binary_search_tree.zig

Browse Source
This commit is contained in:
Yudong Jin 2024-05-17 18:43:01 +08:00 committed by GitHub
parent 838b93b36f
commit b9d3cb1e2c
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
codes/zig/chapter_tree/binary_search_tree.zig
View File

@ -34,7 +34,7 @@ pub fn BinarySearchTree(comptime T: type) type {
fn buildTree(self: *Self, nums: []T, i: usize, j: usize) !?*inc.TreeNode(T) { fn buildTree(self: *Self, nums: []T, i: usize, j: usize) !?*inc.TreeNode(T) {
if (i > j) return null; if (i > j) return null;
// 将数组中间节点作为根节点 // 将数组中间节点作为根节点
var mid = i + (j - i) / 2; var mid = i + (j - i) / 2;
var node = try self.mem_allocator.create(inc.TreeNode(T)); var node = try self.mem_allocator.create(inc.TreeNode(T));
node.init(nums[mid]); node.init(nums[mid]);
// 递归建立左子树和右子树 // 递归建立左子树和右子树