algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-23 01:10:06 +08:00
Code Issues Packages Projects Releases Wiki Activity

Represent null with INT_MAX in C, C++.

Browse Source
This commit is contained in:
krahets
2023-04-18 14:31:23 +08:00
parent ed8fa6aea3
commit 6723cdbc7e
11 changed files with 35 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
codes/cpp/include/TreeNode.hpp
View File

@ -6,6 +6,8 @@
#pragma once
#include <limits.h>
/* Definition for a binary tree node */
struct TreeNode {
int val{};
@ -26,20 +28,21 @@ TreeNode *vecToTree(vector<int> list) {
auto *root = new TreeNode(list[0]);
queue<TreeNode *> que;
que.emplace(root);
size_t n = list.size(), index = 0;
size_t n = list.size(), i = 0;
while (!que.empty()) {
auto node = que.front();
que.pop();
if (++index >= n)
if (++i >= n)
break;
if (index < n) {
node->left = new TreeNode(list[index]);
// INT_MAX represent null
if (list[i] != INT_MAX) {
node->left = new TreeNode(list[i]);
que.emplace(node->left);
}
if (++index >= n)
if (++i >= n)
break;
if (index < n) {
node->right = new TreeNode(list[index]);
if (list[i] != INT_MAX) {
node->right = new TreeNode(list[i]);
que.emplace(node->right);
}
}